The following pages link to Limiting recursion (Q5601468):
Displaying 50 items.
- Convergence of preference functions (Q388149) (← links)
- Computation as an unbounded process (Q418791) (← links)
- Identification of probabilities (Q514153) (← links)
- Extending and interpreting Post's programme (Q636317) (← links)
- Epistemic entrenchment and arithmetical hierarchy (Q685538) (← links)
- Model-theoretic properties of Turing degrees in the Ershov difference hierarchy (Q744306) (← links)
- On the power of probabilistic strategies in inductive inference (Q760795) (← links)
- One-sided error probabilistic inductive inference and reliable frequency identification (Q803119) (← links)
- An approach to intrinsic complexity of uniform learning (Q860823) (← links)
- Learning recursive functions: A survey (Q924164) (← links)
- Learning indexed families of recursive languages from positive data: A survey (Q924177) (← links)
- Learning with belief levels (Q927871) (← links)
- Computable categoricity and the Ershov hierarchy (Q958489) (← links)
- Toward the interpretation of non-constructive reasoning as non-monotonic learning (Q1004290) (← links)
- Bounded query classes and the difference hierarchy (Q1114678) (← links)
- Toward a unified approach for the classification of NP-complete optimization problems (Q1143789) (← links)
- On the quantifier of limiting realizability (Q1147135) (← links)
- Research in the theory of inductive inference by GDR mathematicians - A survey (Q1151889) (← links)
- How to reason defeasibly (Q1199924) (← links)
- Significato e verita nell'aritmetica peaniana (Q1221103) (← links)
- Experimental logics and \(\Delta^0_2\)-theories (Q1222647) (← links)
- On frequency-enumerable sets (Q1222649) (← links)
- Is Gold-Putnam diagonalization complete? (Q1346214) (← links)
- Preface: Super-recursive algorithms and hypercomputation. (Q1434364) (← links)
- Toward a theory of intelligence (Q1434366) (← links)
- Experience, generations, and limits in machine learning (Q1434369) (← links)
- The modal argument for hypercomputing minds (Q1434374) (← links)
- The concept of computability (Q1434377) (← links)
- Uncomputability: The problem of induction internalized (Q1434378) (← links)
- Hypercomputation: Philosophical issues (Q1434379) (← links)
- Computability of a function with jumps: Effective uniformity and limiting recursion (Q1763621) (← links)
- Su certe teorie non enumerabili. (Sulle limitazioni dei sistemi formali. I.) (Q1845881) (← links)
- On learning of functions refutably. (Q1874231) (← links)
- Limiting partial combinatory algebras (Q1884934) (← links)
- Logic and probabilistic systems (Q1915126) (← links)
- Interpolating \(d\)-r.e. and REA degrees between r.e. degrees (Q1919759) (← links)
- Learning figures with the Hausdorff metric by fractals -- towards computable binary classification (Q1945017) (← links)
- On the interplay between inductive inference of recursive functions, complexity theory and recursive numberings (Q2106597) (← links)
- Approximating approximate reasoning: fuzzy sets and the Ershov hierarchy (Q2148810) (← links)
- A survey of results on the d.c.e. and \(n\)-c.e. degrees (Q2263110) (← links)
- On TAE machines and their computational power (Q2334651) (← links)
- Elementary theories and structural properties of d-c.e. and n-c.e. degrees (Q2361673) (← links)
- Inside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functions (Q2442153) (← links)
- A new Gödelian argument for hypercomputing minds based on the busy beaver problem (Q2495984) (← links)
- The case for hypercomputation (Q2497872) (← links)
- The many forms of hypercomputation (Q2497883) (← links)
- System identification via state characterization (Q2557198) (← links)
- Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism (Q2637708) (← links)
- Generalization of Shapiro's theorem to higher arities and noninjective notations (Q2700823) (← links)
- THE MYTH OF 'THE MYTH OF HYPERCOMPUTATION' (Q2842654) (← links)
