Michael Machtey

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