The following pages link to Michael Machtey (Q1158963):
Displaying 10 items.
- A note on structure and looking back applied to the relative complexity of computable functions (Q1158964) (← links)
- Augmented loop languages and classes of computable functions (Q1219687) (← links)
- Minimal pairs of polynomial degrees with subexponential complexity (Q1228203) (← links)
- On the density of honest subrecursive classes (Q1229713) (← links)
- The honest subrecursive classes are a lattice (Q4041560) (← links)
- Helping and the meet of pairs of honest subrecursive classes (Q4055194) (← links)
- Minimal Degrees in Generalized Recursion Theory (Q4101805) (← links)
- Admissible ordinals and intrinsic consistency (Q5622172) (← links)
- Admissible ordinals and lattices of α-R.E. sets (Q5665183) (← links)
- (Q5678842) (← links)