Michael Machtey

发表

Simple Gödel Numberings, Isomorphisms, and Programming Properties

Karl Winklmann, Paul Young, Michael Machtey, 1978, SIAM J. Comput..

Remarks on Recursion versus Diagonalization and Exponentially Difficult Problems

Paul Young, Michael Machtey, 1981, J. Comput. Syst. Sci..

Simple Gödel numberings, translations, and the p-hierarchy (Preliminary Report)

Paul Young, Michael Machtey, 1976, STOC '76.

Augmented Loop Languages and Classes of Computables Functions

Michael Machtey, Michael Machtey, 1972, J. Comput. Syst. Sci..

On the Density of Honest Subrecursive Classes

Michael Machtey, 1975, J. Comput. Syst. Sci..

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

Michael Machtey, 1973, SWAT.

Classification of computable functions by primitive recursive classes

Michael Machtey, Michael Machtey, 1971, STOC.

Admissible Ordinals and Intrinsic Consistency

Michael Machtey, 1970, J. Symb. Log..

An introduction to the general theory of algorithms

Paul Young, Michael Machtey, Michael Machtey, 1978 .

Helping and the Meet of Pairs of Honest Subrecursive Classes

Michael Machtey, 1975, Inf. Control..

Minimal Pairs of Polynomial Degrees with Subexponential Complexity

Michael Machtey, 1976, Theor. Comput. Sci..

The Honest Subrecursive Classes Are a Lattice

Michael Machtey, 1974, Inf. Control..