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