Pages that link to "Item:Q2645094"
From MaRDI portal
The following pages link to General recursive functions of natural numbers (Q2645094):
Displaying 50 items.
- A closed-form evaluation for Datalog queries with integer (gap)-order constraints (Q688670) (← links)
- Instruction sequence processing operators (Q715042) (← links)
- Closure functions and general iterates as reflectors (Q808275) (← links)
- Informal versus formal mathematics (Q885512) (← links)
- Turing oracle machines, online computing, and three displacements in computability theory (Q1032637) (← links)
- Introduction to the concept of recursiveness of fuzzy functions (Q1100197) (← links)
- A universal machine without change of state (Q1100903) (← links)
- Unsolvable algorithmic problems for semigroups, groups and rings (Q1117039) (← links)
- Pre-recursive categories (Q1164127) (← links)
- General iteration and unary functions (Q1182467) (← links)
- Conditional rewriting logic as a unified model of concurrency (Q1190488) (← links)
- On constructivity and the Rosser property: a closer look at some Gödelean proofs (Q1653263) (← links)
- A thesis for interaction (Q2055962) (← links)
- On measure quantifiers in first-order arithmetic (Q2117748) (← links)
- Péter on Church's thesis, constructivity and computers (Q2117808) (← links)
- On the metamathematics of the P vs. NP question (Q2383632) (← links)
- Physical constraints on hypercomputation (Q2482458) (← links)
- How much can analog and hybrid systems be proved (super-)Turing (Q2497875) (← links)
- Varieties of contextuality based on probability and structural nonembeddability (Q2672646) (← links)
- Formalism and intuition in computability (Q2941588) (← links)
- Programs=data=first-class citizens in a computational world (Q2941589) (← links)
- Hierarchies of number-theoretic predicates (Q3226751) (← links)
- Proof of a Conjecture of Routledge (Q3275828) (← links)
- Hyperarithmetical Sets (Q3305318) (← links)
- Remarks on the development of computability (Q3310596) (← links)
- Schemata: The Concept of Schema in the History of Logic (Q3430938) (← links)
- Kleene’s Amazing Second Recursion Theorem (Q3644738) (← links)
- On automorphisms of arbitrary mathematical systems (Q3712321) (← links)
- The theory of recursive functions, approaching its centennial (Q3946156) (← links)
- The work of Kurt Gödel (Q4140948) (← links)
- Recursively enumerable sets and degrees (Q4184825) (← links)
- Step by Recursive Step: Church's Analysis of Effective Calculability (Q4359525) (← links)
- Programs, Grammars and Arguments: A Personal View of some Connections between Computation, Language and Logic (Q4372922) (← links)
- What is a universal higher-order programming language? (Q4630303) (← links)
- Conceptual Confluence in 1936: Post and Turing (Q4637215) (← links)
- Theses for Computation and Recursion on Concrete and Abstract Structures (Q4637218) (← links)
- Why Turing’s Thesis Is Not a Thesis (Q4637226) (← links)
- The Mathematical Work of S.C.Kleene (Q4837673) (← links)
- GÖDEL’S SECOND INCOMPLETENESS THEOREM: HOW IT IS DERIVED AND WHAT IT DELIVERS (Q4984860) (← links)
- REDUCTION TECHNIQUES FOR PROVING DECIDABILITY IN LOGICS AND THEIR MEET–COMBINATION (Q5009679) (← links)
- Encoding many-valued logic in $\lambda$-calculus (Q5009711) (← links)
- Roots and (Re)sources of Value (In)definiteness Versus Contextuality (Q5119677) (← links)
- Appraising two decades of distributed computing theory research (Q5138493) (← links)
- Kalmár's Argument Against the Plausibility of Church's Thesis (Q5207922) (← links)
- Membrane Computing in Connex Environment (Q5452049) (← links)
- Computability and Recursion (Q5689263) (← links)
- Non-deterministic structures of computation (Q5740658) (← links)
- Extensions of some theorems of Gödel and Church (Q5764758) (← links)
- Gödel Theorems for Non-Constructive Logics (Q5768565) (← links)
- On derivability (Q5769238) (← links)
