scientific article; zbMATH DE number 2123258
From MaRDI portal
Proceedings, conferences, collections, etc. pertaining to mathematical logic and foundations (03-06) History of mathematical logic and foundations (03-03) Recursive functions and relations, subrecursive hierarchies (03D20) Turing machines and related notions (03D10) Undecidability and degrees of sets of sentences (03D35)
Recommendations
- Undecidability, incompleteness and Arnol'd problems
- The undecidability of k-provability
- scientific article; zbMATH DE number 1560883
- Remarks on undecidability, incompleteness and the integrability problem
- Undecidability in Some Structures Related to Computation Theory
- Limits of computation. An introduction to the undecidable and the intractable
- scientific article; zbMATH DE number 1984520
- scientific article; zbMATH DE number 572102
- Undecidability and intuitionistic incompleteness
- Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
Cited in
(39)- Who's afraid of mathematical Platonism? -- An historical perspective
- A Logical Autobiography
- Turing oracle machines, online computing, and three displacements in computability theory
- What is a universal computing machine?
- A semantically secure public key cryptoscheme using bit-pair shadows
- A provably secure non-iterative hash function resisting birthday attack
- The philosophy of logic of John Corcoran
- On arithmetical first-order theories allowing encoding and decoding of lists
- Book review of: E. G. Omodeo (ed.) and A. Policriti (ed.), Martin Davis on computability, computational logic, and mathematical foundations
- Why Turing’s Thesis Is Not a Thesis
- Jean van Heijenoort and the Gödel editorial project
- Computer supported mathematics with \(\Omega\)MEGA
- A public key cryptoscheme using bit-pairs with provable semantical security
- Theoretical computer science: computability, decidability and logic
- Testing randomness by Matching Pennies
- On the complex behavior of simple tag systems -- an experimental approach
- Book review of: J. von Plato, The great formal machinery works. Theories of deduction and computation at the origins of the digital age
- A SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY
- Informal and absolute proofs: some remarks from a Gödelian perspective
- Why post did [not] have Turing's thesis
- History and basic features of the critical-pair/completion procedure
- Quantum value indefiniteness
- From Gödel's incompleteness theorem to the completeness of bot beliefs (extended abstract)
- The diagonalization method in quantum recursion theory
- Martingales in the Study of Randomness
- The theory of recursive functions, approaching its centennial
- Gödel on deduction
- A public key cryptosystem based on three new provable problems
- Tag systems and Collatz-like functions
- Closing the Circle: An Analysis of Emil Post's Early Work
- Did Turing stand on Gödel's shoulders?
- Asymptotic granularity reduction and its application
- Introduction to Type Theory
- scientific article; zbMATH DE number 7228887 (Why is no real title available?)
- Incompleteness theorems for random reals
- Distilling the requirements of Gödel's incompleteness theorems with a proof assistant
- Operating system verification---an overview
- The scope of Gödel's first incompleteness theorem
- A formally verified abstract account of Gödel's incompleteness theorems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4830809)
