Search results
From Nordan Symposia
Jump to navigationJump to search
- * A formal definition of [[computation]] and [[computability]], and proof that there are computationally [[halting problem|unsolvable]] ; [[Computability theory (computer science)|Computability theory]]19 KB (2,538 words) - 23:43, 12 December 2020
- ...y theory is a subject of current research. At least in some disciplines of computability theory, the notion of randomness turns out to be identified with computatio13 KB (2,073 words) - 23:41, 12 December 2020
- ...s well beyond the processing capability of current computer systems: see [[computability]] for reasons.13 KB (1,963 words) - 01:27, 13 December 2020
- ...author's definition of a computable function, and to an identification of computability † with effective calculability . . . . ...his "...idea of an algorithm — an effective procedure..." in chapter 5.1 ''Computability, Effective Procedues and Algorithms. Infinite machines."49 KB (7,317 words) - 23:40, 12 December 2020
- ...]], and his presentation of the [[Church-Turing thesis]].<ref>Brookshear, "Computability: Foundations of Recursive Function Theory". Today recursion theory is mostl33 KB (4,933 words) - 01:20, 13 December 2020