Limiting recursion

DOI10.2307/2270580zbMath0203.01201OpenAlexW4237518902WikidataQ55968651 ScholiaQ55968651MaRDI QIDQ5601468

Publication date: 1965

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2270580

Related Items (80)

On learning of functions refutably. ⋮ Elementary theories and structural properties of d-c.e. and n-c.e. degrees ⋮ Limiting partial combinatory algebras ⋮ Is Gold-Putnam diagonalization complete? ⋮ What is the Church-Turing Thesis? ⋮ On the Influence of Technology on Learning Processes ⋮ THE n-r.e. DEGREES: UNDECIDABILITY AND Σ₁ SUBSTRUCTURES ⋮ Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism ⋮ Approximating approximate reasoning: fuzzy sets and the Ershov hierarchy ⋮ An approach to intrinsic complexity of uniform learning ⋮ Infinitary self-reference in learning theory ⋮ Ignoring data may be the only way to learn efficiently ⋮ Bounded query classes and the difference hierarchy ⋮ MODES OF CONVERGENCE TO THE TRUTH: STEPS TOWARD A BETTER EPISTEMOLOGY OF INDUCTION ⋮ Logic and probabilistic systems ⋮ Interpolating \(d\)-r.e. and REA degrees between r.e. degrees ⋮ Convergence of preference functions ⋮ A NOTE ON THE LEARNING-THEORETIC CHARACTERIZATIONS OF RANDOMNESS AND CONVERGENCE ⋮ Toward a unified approach for the classification of NP-complete optimization problems ⋮ Discrete Transfinite Computation ⋮ Fixed-parameter decidability: Extending parameterized complexity analysis ⋮ A classification of low c.e. sets and the Ershov hierarchy ⋮ On the quantifier of limiting realizability ⋮ Computation as an unbounded process ⋮ Learning figures with the Hausdorff metric by fractals -- towards computable binary classification ⋮ Research in the theory of inductive inference by GDR mathematicians - A survey ⋮ Extending and interpreting Post's programme ⋮ A Survey of Results on the d-c.e. and n-c.e. Degrees ⋮ Nondensity of Double Bubbles in the D.C.E. Degrees ⋮ Learning Theory and Epistemology ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Generalization of Shapiro's theorem to higher arities and noninjective notations ⋮ Inside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functions ⋮ Learning recursive functions: A survey ⋮ Learning indexed families of recursive languages from positive data: A survey ⋮ A Calculus of Realizers for EM 1 Arithmetic (Extended Abstract) ⋮ Learning with belief levels ⋮ Preface: Super-recursive algorithms and hypercomputation. ⋮ Toward a theory of intelligence ⋮ Experience, generations, and limits in machine learning ⋮ The modal argument for hypercomputing minds ⋮ The concept of computability ⋮ Uncomputability: The problem of induction internalized ⋮ Hypercomputation: Philosophical issues ⋮ On the Amount of Nonconstructivity in Learning Recursive Functions ⋮ Identification of probabilities ⋮ Epistemic entrenchment and arithmetical hierarchy ⋮ How to reason defeasibly ⋮ Computable categoricity and the Ershov hierarchy ⋮ HIERARCHIES OF GENERALIZED KOLMOGOROV COMPLEXITIES AND NONENUMERABLE UNIVERSAL MEASURES COMPUTABLE IN THE LIMIT ⋮ Two Notions of Sequential Computability of a Function with Jumps ⋮ Finitely Bounded Effective Computability ⋮ Revising Type-2 Computation and Degrees of Discontinuity ⋮ RECOGNIZING STRONG RANDOM REALS ⋮ Computability of a function with jumps: Effective uniformity and limiting recursion ⋮ TRIAL AND ERROR MATHEMATICS I: DIALECTICAL AND QUASIDIALECTICAL SYSTEMS ⋮ A survey of results on the d.c.e. and \(n\)-c.e. degrees ⋮ Total complexity and the inference of best programs ⋮ Significato e verita nell'aritmetica peaniana ⋮ Experimental logics and \(\Delta^0_2\)-theories ⋮ On frequency-enumerable sets ⋮ Unnamed Item ⋮ A new Gödelian argument for hypercomputing minds based on the busy beaver problem ⋮ The case for hypercomputation ⋮ The many forms of hypercomputation ⋮ A Natural Axiomatization of Computability and Proof of Church's Thesis ⋮ Toward the interpretation of non-constructive reasoning as non-monotonic learning ⋮ Unnamed Item ⋮ Model-theoretic properties of Turing degrees in the Ershov difference hierarchy ⋮ Interactive Learning-Based Realizability Interpretation for Heyting Arithmetic with EM 1 ⋮ On the power of probabilistic strategies in inductive inference ⋮ System identification via state characterization ⋮ THE MYTH OF 'THE MYTH OF HYPERCOMPUTATION' ⋮ On TAE machines and their computational power ⋮ Su certe teorie non enumerabili. (Sulle limitazioni dei sistemi formali. I.) ⋮ One-sided error probabilistic inductive inference and reliable frequency identification ⋮ On the interplay between inductive inference of recursive functions, complexity theory and recursive numberings ⋮ Limiting characterizations of low level space complexity classes ⋮ Unnamed Item

Cites Work

This page was built for publication: Limiting recursion