Gödel numberings of partial recursive functions
From MaRDI portal
Publication:3260572
DOI10.2307/2964292zbMath0088.01602OpenAlexW1963780006MaRDI QIDQ3260572
Publication date: 1959
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2964292
Related Items (83)
Characterizing language identification by standardizing operations ⋮ Semi-effective numberings and definitions of the computable numbers ⋮ Program size restrictions in computational learning ⋮ European Summer Meeting of the Association for Symbolic Logic ⋮ Characterization of realizable space complexities ⋮ Memory limited inductive inference machines ⋮ Learnability: Admissible, co-finite, and hypersimple languages ⋮ Learning in the presence of inaccurate information ⋮ Renormalisation and computation II: time cut-off and the Halting Problem ⋮ A complexity measure for data flow models ⋮ Inductive inference of recursive functions: Qualitative theory ⋮ Some general incompleteness results for partial correctness logics ⋮ Programmkomplexität von berechenbaren Funktionen ⋮ Infinitary self-reference in learning theory ⋮ Spatial/kinematic domain and lattice computers ⋮ On aggregating teams of learning machines ⋮ Prudence in vacillatory language identification ⋮ Learning-theoretic perspectives of acceptable numberings ⋮ Isomorphism Types of Index Sets of Partial Recursive Functions ⋮ Numberings, c.e. oracles, and fixed points ⋮ Machine induction without revolutionary paradigm shifts ⋮ On the intrinsic complexity of learning recursive functions ⋮ On two types of concept lattices in the theory of numberings ⋮ A generalized characterization of algorithmic probability ⋮ How much partiality is needed for a theory of computability? ⋮ On Universal Functions ⋮ The independence of control structures in abstract programming systems ⋮ Primitiv-Rekursive Funktionen auf Termmengen ⋮ Learning and extending sublanguages ⋮ Optimal enumerations and optimal gödel numberings ⋮ Effectively closed sets and enumerations ⋮ Probabilistic and team PFIN-type learning: General properties ⋮ Notation Systems and an Effective Fixed Point Property ⋮ Learning in the presence of partial explanations ⋮ Anomalous learning helps succinctness ⋮ Learning multiple languages in groups ⋮ Characterizing language identification in terms of computable numberings ⋮ On the non-existence of maximal inference degrees for language identification ⋮ Things that can be made into themselves ⋮ Program Self-reference in Constructive Scott Subdomains ⋮ Program self-reference in constructive Scott subdomains ⋮ Zipf's law and L. Levin probability distributions ⋮ Some effectively infinite classes of enumerations ⋮ Syntax and semantics of universal programming languages ⋮ Costs of general purpose learning ⋮ Closure operations on measures of computational complexity ⋮ Augmented loop languages and classes of computable functions ⋮ A note on extending equivalence theories of algorithms ⋮ Polynomial and abstract subrecursive classes ⋮ On the density of honest subrecursive classes ⋮ The functions of finite support: a canonical learning problem ⋮ Comparison of identification criteria for machine inductive inference ⋮ Control structures in hypothesis spaces: The influence on learning ⋮ Characterizing programming systems allowing program self-reference ⋮ Computational virtuality in biological systems ⋮ Unnamed Item ⋮ Finite approximate approach to the study of the complexity of recursive predicates ⋮ The origins of the halting problem ⋮ Table approximations to recursive predicates ⋮ Vladimir Andreevich Uspensky (27/11/1930–27/6/2018) ⋮ Reduction of computable and potentially comutable numerations ⋮ On index sets ⋮ The enumerability and invariance of complexity classes ⋮ On interpreting Chaitin's incompleteness theorem ⋮ Robust learning aided by context ⋮ The use of lists in the study of undecidable problems in automata theory ⋮ Translating recursion equations into flow charts ⋮ Computing degrees of unsolvability ⋮ Regular approximations of recursive predicates ⋮ Sequences Having an Effective Fixed-Point Property ⋮ Toward an abstract theory of data compression ⋮ Maximal machine learnable classes ⋮ Unnamed Item ⋮ The synthesis of language learners. ⋮ Learning by the process of elimination ⋮ Enumerations of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msubsup><mml:mi mathvariant="normal">Π</mml:mi><mml:mn>1</mml:mn><mml:mn>0</mml:mn></mml:msubsup></mml:math> Classes: Acceptability and Decidable Classes ⋮ Intensional Kleene and Rice theorems for abstract program semantics ⋮ Composition is almost (but not quite) as good as \(s-1-1\) ⋮ Admissible representations of effective cpo's ⋮ Relativization of the Theory of Computational Complexity ⋮ Training sequences ⋮ La théorie des fonctions récursives et ses applications. (Exposé d'information générale) ⋮ Learning via finitely many queries
Cites Work
This page was built for publication: Gödel numberings of partial recursive functions
