Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Michael Machtey
Observed name:
Michael MacHtey
Institution:
Purdue University West Lafayette
Observed institutions:
Purdue University West Lafayette,
Indiana University Bloomington,
Indiana University
OpenAlex ID:
A5073711307
Works
16
Awards
1
An introduction to the general theory of algorithms
1978
·
Michael Machtey
, Paul R. Young
·
419
A note on structure and looking back applied to the relative complexity of computable functions
1981
·
Paul Chew
, Michael Machtey
·
Journal of Computer and System Sciences
·
42
Augmented loop languages and classes of computable functions
1972
·
Michael Machtey
·
Journal of Computer and System Sciences
·
38
PDF
On the density of honest subrecursive classes
1975
·
Michael Machtey
·
Journal of Computer and System Sciences
·
33
PDF
The honest subrecursive classes are a lattice
1974
·
Michael Machtey
·
Information and Control
·
28
PDF
Simple Gödel Numberings, Isomorphisms, and Programming Properties
1978
·
Michael Machtey
, Karl Winklmann
, et al.
·
SIAM Journal on Computing
·
23
Minimal pairs of polynomial degrees with subexponential complexity
1976
·
Michael Machtey
·
Theoretical Computer Science
·
8
Admissible ordinals and lattices of α-R.E. sets
1971
·
Michael Machtey
·
Annals of Mathematical Logic
·
8
PDF
Remarks on Recursion versus Diagonalization and Exponentially Difficult Problems
1981
·
Michael Machtey
, Paul Young
·
Journal of Computer and System Sciences
·
6
Classification of computable functions by primitive recursive classes
1971
·
Michael Machtey
·
ACM Symposium on Theory of Computing (STOC)
·
5
PDF
Helping and the meet of pairs of honest subrecursive classes
1975
·
Michael MacHtey
·
Information and Control
·
4
Admissible ordinals and intrinsic consistency
1970
·
Michael Machtey
·
Journal of Symbolic Logic
·
4
Simple Gödel numberings, translations, and the p-hierarchy (Preliminary Report)
1976
·
Michael Machtey
, Paul Young
·
ACM Symposium on Theory of Computing (STOC)
·
3
Minimal Degrees in Generalized Recursion Theory
1974
·
Michael Machtey
·
Mathematical logic quarterly
·
1
Remarks on Recursion vs. Diagonalization
1978
·
Michael Machtey
·
Purdue e-Pubs (Purdue University System)
PDF
A notion of helping and pseudo-complementation in lattices of honest subrecursive classes
1973
·
Michael Machtey
·
Annual Symposium on Switching & Automata Theory
Show more works
View as search
Works count:
16
Citation count:
622
H-index:
8
I10-index:
6
Year
Topic
Type