General recursive functions of natural numbers
From MaRDI portal
Publication:2645094
DOI10.1007/BF01565439zbMath0014.19402WikidataQ56037875 ScholiaQ56037875MaRDI QIDQ2645094
Publication date: 1936
Published in: Mathematische Annalen (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/159849
Related Items (71)
Classes of Recursively Enumerable Sets and Their Decision Problems ⋮ Recursive Functions and Intuitionistic Number Theory ⋮ On automorphisms of arbitrary mathematical systems ⋮ Recursive Predicates and Quantifiers ⋮ Introduction to the concept of recursiveness of fuzzy functions ⋮ A universal machine without change of state ⋮ On the metamathematics of the P vs. NP question ⋮ On constructivity and the Rosser property: a closer look at some Gödelean proofs ⋮ Unsolvable algorithmic problems for semigroups, groups and rings ⋮ The Mathematical Work of S.C.Kleene ⋮ Formalism and intuition in computability ⋮ Programs=data=first-class citizens in a computational world ⋮ Informal versus formal mathematics ⋮ Varieties of contextuality based on probability and structural nonembeddability ⋮ On the coincidence of complexity classes BPC and \(\text{TC}^0 \) ⋮ Hierarchies of number-theoretic predicates ⋮ Computation models and function algebras ⋮ Expressing power of elementary quantum recursion schemes for quantum logarithmic-time computability ⋮ How much partiality is needed for a theory of computability? ⋮ Roots and (Re)sources of Value (In)definiteness Versus Contextuality ⋮ Pre-recursive categories ⋮ Computability and Recursion ⋮ Appraising two decades of distributed computing theory research ⋮ What is a universal higher-order programming language? ⋮ Step by Recursive Step: Church's Analysis of Effective Calculability ⋮ General iteration and unary functions ⋮ Conceptual Confluence in 1936: Post and Turing ⋮ Theses for Computation and Recursion on Concrete and Abstract Structures ⋮ Why Turing’s Thesis Is Not a Thesis ⋮ Hyperarithmetical Sets ⋮ Programs, Grammars and Arguments: A Personal View of some Connections between Computation, Language and Logic ⋮ Conditional rewriting logic as a unified model of concurrency ⋮ Remarks on the development of computability ⋮ A closed-form evaluation for Datalog queries with integer (gap)-order constraints ⋮ Physical constraints on hypercomputation ⋮ Non-deterministic structures of computation ⋮ The work of Kurt Gödel ⋮ How much can analog and hybrid systems be proved (super-)Turing ⋮ Instruction sequence processing operators ⋮ Extensions of some theorems of Gödel and Church ⋮ Gödel Theorems for Non-Constructive Logics ⋮ On derivability ⋮ On the reduction of the decision problem. First paper. Ackermann prefix, a single binary predicate ⋮ On notation for ordinal numbers ⋮ Membrane Computing in Connex Environment ⋮ Bemerkungen zum Begriff der inhaltlichen Widerspruchsfreiheit ⋮ An informal exposition of proofs of Gödel's theorems and Church's theorem ⋮ Kalmár's Argument Against the Plausibility of Church's Thesis ⋮ Constructible falsity ⋮ Nicht konstruktiv beweisbare Sätze der Analysis ⋮ Recursively enumerable sets and degrees ⋮ Zusammenhang der mehrfachen und transfiniten Rekursionen ⋮ A note on nominalism and recursive functions ⋮ A thesis for interaction ⋮ Contributions to the reduction theory of the decision problem ⋮ Kleene’s Amazing Second Recursion Theorem ⋮ Arithmetical problems and recursively enumerable predicates ⋮ GÖDEL’S SECOND INCOMPLETENESS THEOREM: HOW IT IS DERIVED AND WHAT IT DELIVERS ⋮ Turing oracle machines, online computing, and three displacements in computability theory ⋮ Representations of calculi ⋮ On the interpretation of intuitionistic number theory ⋮ Proof of a Conjecture of Routledge ⋮ REDUCTION TECHNIQUES FOR PROVING DECIDABILITY IN LOGICS AND THEIR MEET–COMBINATION ⋮ Encoding many-valued logic in $\lambda$-calculus ⋮ Schemata: The Concept of Schema in the History of Logic ⋮ A SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY ⋮ The theory of recursive functions, approaching its centennial ⋮ Recursive Functions and Intuitionistic Number Theory ⋮ Closure functions and general iterates as reflectors ⋮ On measure quantifiers in first-order arithmetic ⋮ Péter on Church's thesis, constructivity and computers
Cites Work
This page was built for publication: General recursive functions of natural numbers
