 | 1981 |
|---|
| 12 |       | Paul Chew,
Michael Machtey:
A Note on Structure and Looking Back Applied to the Complexity of Computable Functions.
J. Comput. Syst. Sci. 22(1): 53-59 (1981) |
| 11 | | Michael Machtey,
Paul Young:
Remarks on Recursion versus Diagonalization and Exponentially Difficult Problems.
J. Comput. Syst. Sci. 22(3): 442-453 (1981) |
| 1978 |
|---|
| 10 | | Michael Machtey,
Karl Winklmann,
Paul Young:
Simple Gödel Numberings, Isomorphisms, and Programming Properties.
SIAM J. Comput. 7(1): 39-60 (1978) |
| 1976 |
|---|
| 9 | | Michael Machtey,
Paul Young:
Simple Gödel Numberings, Translations, and the P-Hierarchy
STOC 1976: 236-243 |
| 8 | | Michael Machtey:
Minimal Pairs of Polynomial Degrees with Subexponential Complexity.
Theor. Comput. Sci. 2(1): 73-76 (1976) |
| 1975 |
|---|
| 7 | | Michael Machtey:
Helping and the Meet of Pairs of Honest Subrecursive Classes
Information and Control 28(1): 76-89 (1975) |
| 6 | | Michael Machtey:
On the Density of Honest Subrecursive Classes.
J. Comput. Syst. Sci. 10(2): 183-199 (1975) |
| 1974 |
|---|
| 5 | | Michael Machtey:
The Honest Subrecursive Classes Are a Lattice
Information and Control 24(3): 247-263 (1974) |
| 1973 |
|---|
| 4 | | Michael Machtey:
A Notion of Helping and Pseudo-Complementation in Lattices of Honest Subrecursive Classes
FOCS 1973: 181-189 |
| 1972 |
|---|
| 3 | | Michael Machtey:
Augmented Loop Languages and Classes of Computables Functions.
J. Comput. Syst. Sci. 6(6): 603-624 (1972) |
| 1971 |
|---|
| 2 | | Michael Machtey:
Classification of Computable Functions by Primitive Recursive Classes
STOC 1971: 251-257 |
| 1970 |
|---|
| 1 | | Michael Machtey:
Admissible Ordinals and Intrinsic Consistency.
J. Symb. Log. 35(3): 389-400 (1970) |
