![Theory of computation / Computability theory / Busy beaver / Computable function / Computability / Turing machine / Halting problem / Hypercomputation / Computable number / Algorithm / Alan Turing / Ackermann function Theory of computation / Computability theory / Busy beaver / Computable function / Computability / Turing machine / Halting problem / Hypercomputation / Computable number / Algorithm / Alan Turing / Ackermann function](https://www.pdfsearch.io/img/e5c3a3e6e26e281226bdb552760d01ce.jpg) Date: 2008-12-18 11:10:27Theory of computation Computability theory Busy beaver Computable function Computability Turing machine Halting problem Hypercomputation Computable number Algorithm Alan Turing Ackermann function | | Who Can Name the Bigger Number? Scott Aaronson∗ 1999 In an old joke, two noblemen vie to name the bigger number. The first, after ruminating for hours, triumphantly announces ”Eighty-three!” The second,Add to Reading ListSource URL: www.scottaaronson.comDownload Document from Source Website File Size: 132,03 KBShare Document on Facebook
|