Revision #739 → #1080 · back to history
addedChurch–Turing thesis0a805db46e66
addedGeneral recursive functionse53a924178d7
addedλ-computable function5bf055e06d3f
addedTuring computable function93a314102b48
addedEquivalence of computability models96514acbf97a
addedEffective method (Rosser)829ea979752e
addedEffectively calculable vs computable2a7a290f1b67
addedStatement of the thesis8f5529f2d83c
addedUnsolvability of the Entscheidungsprobleme0ec27b8ac0e
addedEquivalence of λ-calculus and Turing machines2d04dfb0d989
addedRosser's identification66968cd3dfef
addedKleene's Thesis I91039f9d6ce6
addedTheorem XXX (Kleene)e684b2f3750d
addedTuring's thesis0b2d1a607861
addedGandy's theorema022684a3f3d
addedSieg's computor constraints61184e923f05
addedGödel absoluteness of reckonability333f2be8b4ef
addedInfinite RE set contains infinite recursive subset26ca2c5560f7
addedPhysical Church–Turing thesisc77186c6cb70
addedLogarithmic slowdown of universal Turing machine2d8c7880b20e
addedFeasibility (extended Church–Turing) thesis8265acd7de35
addedInvariance thesise73b714c945b
addedQuantum complexity-theoretic Church–Turing thesisc22007f5feed
addedBusy Beaver function73a3857129ad
addedBusy Beaver and the halting problem76dac6c3dc6e