Pages that link to "Item:Q5537605"
From MaRDI portal
The following pages link to A Machine-Independent Theory of the Complexity of Recursive Functions (Q5537605):
Displaying 50 items.
- Reverse complexity (Q287279) (← links)
- Strongly non-U-shaped language learning results by general techniques (Q342700) (← links)
- Mind change speed-up for learning languages from positive data (Q388110) (← links)
- Iterative learning from texts and counterexamples using additional information (Q415613) (← links)
- Entropy algebras and Birkhoff factorization (Q490978) (← links)
- Comparison of identification criteria for machine inductive inference (Q585192) (← links)
- Learning all subfunctions of a function (Q596299) (← links)
- Speedup for natural problems and noncomputability (Q620964) (← links)
- Optimal language learning from positive data (Q642522) (← links)
- Anomalous learning helps succinctness (Q671420) (← links)
- Effective category and measure in abstract complexity theory (Q672752) (← links)
- A note on the diagonalizable algebras of PA and ZF (Q685077) (← links)
- On the non-existence of maximal inference degrees for language identification (Q685478) (← links)
- Program self-reference in constructive Scott subdomains (Q693046) (← links)
- Accepting networks of genetic processors are computationally complete (Q714860) (← links)
- Characterizing programming systems allowing program self-reference (Q733737) (← links)
- Resource restricted computability theoretic learning: Illustrative topics and problems (Q733738) (← links)
- Speed-up theorems in type-2 computations using oracle Turing machines (Q733754) (← links)
- A note on almost-everywhere-complex sets and separating deterministic- time-complexity classes (Q756423) (← links)
- Computation of recursive functionals using minimal initial segments (Q787965) (← links)
- Toward an abstract theory of data compression (Q794162) (← links)
- On the complexity-relativized strong reducibilities (Q800353) (← links)
- One-sided error probabilistic inductive inference and reliable frequency identification (Q803119) (← links)
- On the inference of approximate programs (Q803121) (← links)
- The lengths of proofs: Kreisel's conjecture and Gödel's speed-up theorem (Q843609) (← links)
- Learning languages in a union (Q859985) (← links)
- A note on A.E. h-complex functions (Q909459) (← links)
- Reversible parallel computation: An evolving space-model (Q909469) (← links)
- A complexity theory of efficient parallel algorithms (Q913512) (← links)
- Parametrization over inductive relations of a bounded number of variables (Q917545) (← links)
- On a complexity-based way of constructivizing the recursive functions (Q922528) (← links)
- Learning recursive functions: A survey (Q924164) (← links)
- Reflective inductive inference of recursive functions (Q924166) (← links)
- Learning indexed families of recursive languages from positive data: A survey (Q924177) (← links)
- Learning and extending sublanguages (Q924178) (← links)
- Non-U-shaped vacillatory and team learning (Q927864) (← links)
- Learning languages from positive data and negative counterexamples (Q927865) (← links)
- Learning in Friedberg numberings (Q939445) (← links)
- Consistent and coherent learning with \(\delta \)-delay (Q958312) (← links)
- On some open problems in reflective inductive inference (Q976076) (← links)
- U-shaped, iterative, and iterative-with-counter learning (Q1009263) (← links)
- Factorizing RSA keys, an improved analogue solution (Q1031929) (← links)
- Instability, complexity, and evolution (Q1036993) (← links)
- Uncontrollable computational growth in theoretical physics (Q1071512) (← links)
- Type 2 recursion theory (Q1073021) (← links)
- The basic theory of partial \(\alpha\)-recursive operators (Q1078175) (← links)
- Approximation to measurable functions and its relation to probabilistic computation (Q1088659) (← links)
- Lower bounds on degrees of game-theoretic structures (Q1106754) (← links)
- On the power of recursive optimizers (Q1114401) (← links)
- Saving the phenomena: Requirements that inductive inference machines not contradict known data (Q1115637) (← links)
