Michael Machtey

Publication Activity (10 Years)

Years Active: 1970-1981
Publications (10 Years): 0

Publications

Paul Chew, Michael Machtey
A Note on Structure and Looking Back Applied to the Complexity of Computable Functions. J. Comput. Syst. Sci. 22 (1) (1981)
Michael Machtey, Paul Young
Remarks on Recursion versus Diagonalization and Exponentially Difficult Problems. J. Comput. Syst. Sci. 22 (3) (1981)
Michael Machtey, Karl Winklmann, Paul Young
Simple Gödel Numberings, Isomorphisms, and Programming Properties. SIAM J. Comput. 7 (1) (1978)
Michael Machtey, Paul Young
Simple Gödel Numberings, Translations, and the P-Hierarchy STOC (1976)
Michael Machtey
Minimal Pairs of Polynomial Degrees with Subexponential Complexity. Theor. Comput. Sci. 2 (1) (1976)
Michael Machtey
On the Density of Honest Subrecursive Classes. J. Comput. Syst. Sci. 10 (2) (1975)
Michael Machtey
Helping and the Meet of Pairs of Honest Subrecursive Classes Inf. Control. 28 (1) (1975)
Michael Machtey
The Honest Subrecursive Classes Are a Lattice Inf. Control. 24 (3) (1974)
Michael Machtey
A Notion of Helping and Pseudo-Complementation in Lattices of Honest Subrecursive Classes SWAT (1973)
Michael Machtey
Augmented Loop Languages and Classes of Computables Functions. J. Comput. Syst. Sci. 6 (6) (1972)
Michael Machtey
Classification of Computable Functions by Primitive Recursive Classes STOC (1971)
Michael Machtey
Admissible Ordinals and Intrinsic Consistency. J. Symb. Log. 35 (3) (1970)