Revision #85 → #1104 · back to history
addedComputable function (informal)0de2ae7734d7
addedChurch–Turing thesis (lead)2b181fd07b15
addedFunction problembc5d604735e9
addedComputable function (formal)af405b36803f
addedμ-recursive functionsf62933f91039
addedCalculability via a programe8ed1dd7317d
addedBasic characteristic of a computable function53edcf5d79ea
addedSummary characterization of computabilityb6cee2236774
addedComputable sete475f3d97b04
addedComputably enumerable set68facd12da03
addedEquivalent characterizations of c.e. setsf0d65a66897a
addedComputable and c.e. relations792743eb1d74
addedAlphabetbc0ed3e903d2
addedLanguage6a6944021267
addedComputable languaged70685954e43
addedComputably enumerable language194a241d9eae
addedExamples of computable functions4e6c3a301e05
addedClosure of computable functions82eee355c6d8
addedRuns of fives in π483caa56aa4a
addedFinite segment of an uncomputable sequence33ac90169d3c
addedChurch–Turing thesis (statement)22666fef85e8
addedProvably total function9dfa850af583
addedProvably total functions are r.e.e21909366a30
addedRecursive definitiond27bca9a4ef0
addedAckermann function255a66382ca5
addedWell-ordered recursive functions are computable78445653f896
addedTotal functions not provably total exist565f5e42dbd6
addedCountably many computable functions9e7746445823
addedMost real numbers are not computable74ff2ef89f89
addedMost subsets of naturals not computable5faef92ce60f
addedEntscheidungsproblem is undecidable2ba5c762452d
addedComputability relative to A0e8cb595823f
addedHyperarithmetical theory0af9906a18e0