The following pages link to Indexings of subrecursive classes (Q1140080):
Displaying 15 items.
- Characterizing programming systems allowing program self-reference (Q733737) (← links)
- Polynomial time computations in models of ET (Q795035) (← links)
- Some remarks on witness functions for nonpolynomial and noncomplete sets in NP (Q1079364) (← links)
- Diagonalizations over polynomial time computable sets (Q1107526) (← links)
- Simplicity, immunity, relativizations and nondeterminism (Q1115610) (← links)
- Remarks on recursion versus diagonalization and exponentially difficult problems (Q1156483) (← links)
- On p-creative sets and p-completely creative sets (Q1183565) (← links)
- Diagonalization, uniformity, and fixed-point theorems (Q1201287) (← links)
- On 1-truth-table-hard languages (Q1261477) (← links)
- Intensional Kleene and Rice theorems for abstract program semantics (Q2105439) (← links)
- Subrecursive equivalence relations and (non-)closure under lattice operations (Q2117798) (← links)
- Generality's price: Inescapable deficiencies in machine-learned programs (Q2368918) (← links)
- Logics for reasoning about cryptographic constructions (Q2490263) (← links)
- Meeting of the Association for Symbolic Logic, Madison, 1982 (Q3313844) (← links)
- A complete characterization of infinitely repeated two-player games having computable strategies with no computable best response under limit-of-means payoff (Q6090449) (← links)
