Michael Machtey

According to our database, Michael Machtey authored at least 12 papers between 1970 and 1981.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

1981

Remarks on Recursion versus Diagonalization and Exponentially Difficult Problems.

Michael Machtey, Paul Young

J. Comput. Syst. Sci., 1981

A Note on Structure and Looking Back Applied to the Complexity of Computable Functions.

Paul Chew, Michael Machtey

J. Comput. Syst. Sci., 1981

1978

Simple Gödel Numberings, Isomorphisms, and Programming Properties.

Michael Machtey, Karl Winklmann, Paul Young

SIAM J. Comput., 1978

1976

Minimal Pairs of Polynomial Degrees with Subexponential Complexity.

Michael Machtey

Theor. Comput. Sci., 1976

Simple Gödel Numberings, Translations, and the P-Hierarchy

Michael Machtey, Paul Young

Proceedings of the 8th Annual ACM Symposium on Theory of Computing, 1976

1975

Helping and the Meet of Pairs of Honest Subrecursive Classes

Michael Machtey

Inf. Control., May, 1975

On the Density of Honest Subrecursive Classes.

Michael Machtey

J. Comput. Syst. Sci., 1975

1974

The Honest Subrecursive Classes Are a Lattice

Michael Machtey

Inf. Control., March, 1974

1973

A Notion of Helping and Pseudo-Complementation in Lattices of Honest Subrecursive Classes

Michael Machtey

Proceedings of the 14th Annual Symposium on Switching and Automata Theory, 1973

1972

Augmented Loop Languages and Classes of Computables Functions.

Michael Machtey

J. Comput. Syst. Sci., 1972

1971

Classification of Computable Functions by Primitive Recursive Classes

Michael Machtey

Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, 1971

1970

Admissible Ordinals and Intrinsic Consistency.

Michael Machtey

J. Symb. Log., 1970