Admissible Ordinals and Intrinsic Consistency. - Michael Machtey (J. Symb. Log., 1970)

Classification of Computable Functions by Primitive Recursive Classes - Michael Machtey (STOC, 1971)

Augmented Loop Languages and Classes of Computables Functions. - Michael Machtey (J. Comput. Syst. Sci., 1972)

A Notion of Helping and Pseudo-Complementation in Lattices of Honest Subrecursive Classes - Michael Machtey (SWAT, 1973)

The Honest Subrecursive Classes Are a Lattice - Michael Machtey (Inf. Control., 1974)

On the Density of Honest Subrecursive Classes. - Michael Machtey (J. Comput. Syst. Sci., 1975)

Helping and the Meet of Pairs of Honest Subrecursive Classes - Michael Machtey (Inf. Control., 1975)

Simple Gödel Numberings, Translations, and the P-Hierarchy - Michael Machtey; Paul Young (STOC, 1976)

Minimal Pairs of Polynomial Degrees with Subexponential Complexity. - Michael Machtey (Theor. Comput. Sci., 1976)

Simple Gödel Numberings, Isomorphisms, and Programming Properties. - Michael Machtey; Karl Winklmann; Paul Young (SIAM J. Comput., 1978)

A Note on Structure and Looking Back Applied to the Complexity of Computable Functions. - Paul Chew; Michael Machtey (J. Comput. Syst. Sci., 1981)

Remarks on Recursion versus Diagonalization and Exponentially Difficult Problems. - Michael Machtey; Paul Young (J. Comput. Syst. Sci., 1981)