Limiting recursion
From MaRDI portal
Publication:5601468
Cites work
Cited in
(81)- A survey of results on the d-c.e. and n-c.e. degrees
- Approximating approximate reasoning: fuzzy sets and the Ershov hierarchy
- Hypercomputation: Philosophical issues
- Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism
- Research in the theory of inductive inference by GDR mathematicians - A survey
- A survey of results on the d.c.e. and \(n\)-c.e. degrees
- Elementary theories and structural properties of d-c.e. and n-c.e. degrees
- The case for hypercomputation
- The many forms of hypercomputation
- Computable categoricity and the Ershov hierarchy
- Experience, generations, and limits in machine learning
- Preface: Super-recursive algorithms and hypercomputation.
- On the solvability of inductive problems: a study in epistemic topology
- Learning recursive functions: A survey
- How to reason defeasibly
- The concept of computability
- Uncomputability: The problem of induction internalized
- Learning with belief levels
- On the amount of nonconstructivity in learning recursive functions
- HIERARCHIES OF GENERALIZED KOLMOGOROV COMPLEXITIES AND NONENUMERABLE UNIVERSAL MEASURES COMPUTABLE IN THE LIMIT
- On learning of functions refutably.
- Ignoring data may be the only way to learn efficiently
- Inside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functions
- Computation as an unbounded process
- scientific article; zbMATH DE number 3503215 (Why is no real title available?)
- Computability of a function with jumps: Effective uniformity and limiting recursion
- Bounded query classes and the difference hierarchy
- Modes of convergence to the truth: steps toward a better epistemology of induction
- Learning figures with the Hausdorff metric by fractals -- towards computable binary classification
- Model-theoretic properties of Turing degrees in the Ershov difference hierarchy
- System identification via state characterization
- Toward the interpretation of non-constructive reasoning as non-monotonic learning
- Epistemic entrenchment and arithmetical hierarchy
- One-sided error probabilistic inductive inference and reliable frequency identification
- An approach to intrinsic complexity of uniform learning
- Toward a unified approach for the classification of NP-complete optimization problems
- Convergence of preference functions
- A Natural Axiomatization of Computability and Proof of Church's Thesis
- Toward a theory of intelligence
- Two notions of sequential computability of a function with jumps
- Nondensity of Double Bubbles in the D.C.E. Degrees
- Learning indexed families of recursive languages from positive data: A survey
- Revising type-2 computation and degrees of discontinuity
- Finitely bounded effective computability
- Is Gold-Putnam diagonalization complete?
- Fixed-parameter decidability: extending parameterized complexity analysis
- The \(n\)-r.e. degrees: undecidability and \(\Sigma_1\) substructures
- Logic and probabilistic systems
- Identification of probabilities
- On the quantifier of limiting realizability
- On TAE machines and their computational power
- On the interplay between inductive inference of recursive functions, complexity theory and recursive numberings
- Experimental logics and \(\Delta^0_2\)-theories
- Limiting partial combinatory algebras
- Su certe teorie non enumerabili. (Sulle limitazioni dei sistemi formali. I.)
- The myth of `the myth of hypercomputation'
- Infinitary self-reference in learning theory
- Extending and interpreting Post's programme
- On the power of probabilistic strategies in inductive inference
- Significato e verita nell'aritmetica peaniana
- Interpolating \(d\)-r.e. and REA degrees between r.e. degrees
- The modal argument for hypercomputing minds
- On frequency-enumerable sets
- A Calculus of Realizers for EM 1 Arithmetic (Extended Abstract)
- What is the Church-Turing Thesis?
- Learning to act and observe in partially observable domains
- Trial and error mathematics. I: Dialectical and quasidialectical systems
- A new Gödelian argument for hypercomputing minds based on the busy beaver problem
- A classification of low c.e. sets and the Ershov hierarchy
- On the influence of technology on learning processes
- Interactive Learning-Based Realizability Interpretation for Heyting Arithmetic with EM 1
- scientific article; zbMATH DE number 3932271 (Why is no real title available?)
- A NOTE ON THE LEARNING-THEORETIC CHARACTERIZATIONS OF RANDOMNESS AND CONVERGENCE
- A Galois connection between Turing jumps and limits
- Generalization of Shapiro's theorem to higher arities and noninjective notations
- Learning theory and epistemology
- Limiting characterizations of low level space complexity classes
- Recognizing strong random reals
- Total complexity and the inference of best programs
- Special splitting in the 2-c.e. Turing degrees
- Cellular automata are generic
This page was built for publication: Limiting recursion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5601468)
