The following pages link to Limiting recursion (Q5601468):
Displaying 32 items.
- Discrete transfinite computation models (Q2906573) (← links)
- The \(n\)-r.e. degrees: undecidability and \(\Sigma_1\) substructures (Q2909622) (← links)
- Fixed-parameter decidability: Extending parameterized complexity analysis (Q2958220) (← links)
- A Survey of Results on the d-c.e. and n-c.e. Degrees (Q2970973) (← links)
- Nondensity of Double Bubbles in the D.C.E. Degrees (Q2970979) (← links)
- Learning Theory and Epistemology (Q2971697) (← links)
- On the Amount of Nonconstructivity in Learning Recursive Functions (Q3010414) (← links)
- HIERARCHIES OF GENERALIZED KOLMOGOROV COMPLEXITIES AND NONENUMERABLE UNIVERSAL MEASURES COMPUTABLE IN THE LIMIT (Q3021972) (← links)
- Limiting characterizations of low level space complexity classes (Q3142271) (← links)
- On the Influence of Technology on Learning Processes (Q3458194) (← links)
- A Calculus of Realizers for EM 1 Arithmetic (Extended Abstract) (Q3540181) (← links)
- RECOGNIZING STRONG RANDOM REALS (Q3580658) (← links)
- A Natural Axiomatization of Computability and Proof of Church's Thesis (Q3616433) (← links)
- Interactive Learning-Based Realizability Interpretation for Heyting Arithmetic with EM 1 (Q3637184) (← links)
- (Q3704795) (← links)
- (Q4083409) (← links)
- Total complexity and the inference of best programs (Q4133125) (← links)
- Infinitary self-reference in learning theory (Q4290127) (← links)
- Ignoring data may be the only way to learn efficiently (Q4290134) (← links)
- (Q4585068) (← links)
- Two Notions of Sequential Computability of a Function with Jumps (Q4916195) (← links)
- Finitely Bounded Effective Computability (Q4918041) (← links)
- Revising Type-2 Computation and Degrees of Discontinuity (Q4921445) (← links)
- (Q5013888) (← links)
- (Q5015385) (← links)
- What is the Church-Turing Thesis? (Q5055286) (← links)
- MODES OF CONVERGENCE TO THE TRUTH: STEPS TOWARD A BETTER EPISTEMOLOGY OF INDUCTION (Q5078810) (← links)
- A NOTE ON THE LEARNING-THEORETIC CHARACTERIZATIONS OF RANDOMNESS AND CONVERGENCE (Q5099786) (← links)
- TRIAL AND ERROR MATHEMATICS I: DIALECTICAL AND QUASIDIALECTICAL SYSTEMS (Q5741615) (← links)
- A classification of low c.e. sets and the Ershov hierarchy (Q6140757) (← links)
- Learning to act and observe in partially observable domains (Q6612817) (← links)
- Special splitting in the 2-c.e. Turing degrees (Q6634989) (← links)
