First Page | Document Content | |
---|---|---|
Date: 2016-05-03 08:34:47Mathematics Theoretical computer science Computability theory Mathematical logic Theory of computation Turing machine Models of computation Busy beaver Halting problem ZermeloFraenkel set theory Computability Computable function | A Relatively Small Turing Machine Whose Behavior Is Independent of Set Theory Adam Yedidia Scott AaronsonAdd to Reading ListSource URL: www.scottaaronson.comDownload Document from Source WebsiteFile Size: 1,03 MBShare Document on Facebook |