scientific article; zbMATH DE number 2123258

zbMath1099.03002MaRDI QIDQ4830809

No author found.

Publication date: 16 December 2004

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) History of mathematical logic and foundations (03-03) Proceedings, conferences, collections, etc. pertaining to mathematical logic and foundations (03-06) Recursive functions and relations, subrecursive hierarchies (03D20) Turing machines and related notions (03D10)

Related Items (35)

Book review of: J. von Plato, The great formal machinery works. Theories of deduction and computation at the origins of the digital age ⋮ Gödel on deduction ⋮ Unnamed Item ⋮ History and basic features of the critical-pair/completion procedure ⋮ Incompleteness theorems for random reals ⋮ A semantically secure public key cryptoscheme using bit-pair shadows ⋮ A provably secure non-iterative hash function resisting birthday attack ⋮ A Public Key Cryptoscheme Using Bit-Pairs with Provable Semantical Security ⋮ Computer supported mathematics with \(\Omega\)MEGA ⋮ Book review of: E. G. Omodeo (ed.) and A. Policriti (ed.), Martin Davis on computability, computational logic, and mathematical foundations ⋮ On the complex behavior of simple tag systems -- an experimental approach ⋮ Martingales in the Study of Randomness ⋮ A public key cryptosystem based on three new provable problems ⋮ Jean van Heijenoort and the Gödel editorial project ⋮ Did Turing stand on Gödel's shoulders? ⋮ From Gödel's incompleteness theorem to the completeness of bot beliefs (extended abstract) ⋮ On arithmetical first-order theories allowing encoding and decoding of lists ⋮ Why Turing’s Thesis Is Not a Thesis ⋮ Why Post Did [Not Have Turing’s Thesis] ⋮ Tag systems and Collatz-like functions ⋮ The scope of Gödel's first incompleteness theorem ⋮ Quantum value indefiniteness ⋮ The diagonalization method in quantum recursion theory ⋮ Introduction to Type Theory ⋮ Asymptotic granularity reduction and its application ⋮ Informal and absolute proofs: some remarks from a Gödelian perspective ⋮ Distilling the requirements of Gödel's incompleteness theorems with a proof assistant ⋮ A formally verified abstract account of Gödel's incompleteness theorems ⋮ Turing oracle machines, online computing, and three displacements in computability theory ⋮ What is a universal computing machine? ⋮ Operating system verification---an overview ⋮ Closing the Circle: An Analysis of Emil Post's Early Work ⋮ A SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY ⋮ The theory of recursive functions, approaching its centennial ⋮ A Logical Autobiography

This page was built for publication: