Michael Machtey
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
1980 – 1989
- 1981
- [j9]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) - [j8]Michael Machtey, Paul Young:
Remarks on Recursion versus Diagonalization and Exponentially Difficult Problems. J. Comput. Syst. Sci. 22(3): 442-453 (1981)
1970 – 1979
- 1978
- [j7]Michael Machtey, Karl Winklmann, Paul Young:
Simple Gödel Numberings, Isomorphisms, and Programming Properties. SIAM J. Comput. 7(1): 39-60 (1978) - 1976
- [j6]Michael Machtey:
Minimal Pairs of Polynomial Degrees with Subexponential Complexity. Theor. Comput. Sci. 2(1): 73-76 (1976) - [c3]Michael Machtey, Paul Young:
Simple Gödel Numberings, Translations, and the P-Hierarchy. STOC 1976: 236-243 - 1975
- [j5]Michael Machtey:
Helping and the Meet of Pairs of Honest Subrecursive Classes. Information and Control 28(1): 76-89 (1975) - [j4]Michael Machtey:
On the Density of Honest Subrecursive Classes. J. Comput. Syst. Sci. 10(2): 183-199 (1975) - 1974
- [j3]Michael Machtey:
The Honest Subrecursive Classes Are a Lattice. Information and Control 24(3): 247-263 (1974) - 1973
- [c2]Michael Machtey:
A Notion of Helping and Pseudo-Complementation in Lattices of Honest Subrecursive Classes. SWAT (FOCS) 1973: 181-189 - 1972
- [j2]Michael Machtey:
Augmented Loop Languages and Classes of Computables Functions. J. Comput. Syst. Sci. 6(6): 603-624 (1972) - 1971
- [c1]Michael Machtey:
Classification of Computable Functions by Primitive Recursive Classes. STOC 1971: 251-257 - 1970
- [j1]
last updated on 2019-01-09 01:44 CET by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint