Limiting recursion

DOI10.2307/2270580zbMATH Open0203.01201OpenAlexW4237518902WikidataQ55968651 ScholiaQ55968651MaRDI QIDQ5601468FDOQ5601468

Authors: E. Mark Gold 

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

Cites Work

• Automata Studies. (AM-34)
• State-identification experiments in finite automata
• Regularity preserving modifications of regular expressions

Cited In (82)

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

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)