![Applied mathematics / Alan Turing / Turing machine / Theory of computation / Models of computation / Computability / NP / Machine that always halts / Halting problem / Theoretical computer science / Computability theory / Mathematics Applied mathematics / Alan Turing / Turing machine / Theory of computation / Models of computation / Computability / NP / Machine that always halts / Halting problem / Theoretical computer science / Computability theory / Mathematics](https://www.pdfsearch.io/img/45339a3dd4f259e0301739521dded60a.jpg) Date: 2006-03-16 11:03:47Applied mathematics Alan Turing Turing machine Theory of computation Models of computation Computability NP Machine that always halts Halting problem Theoretical computer science Computability theory Mathematics | | CAN A TURING PLAYER IDENTIFY ITSELF? DAVID K. LEVINE AND AND BALÁZS SZENTES A BSTRACT. We show that the problem of whether two Turing Machines are functionally equivalent is undecidable and explain why this is significaAdd to Reading ListSource URL: www.dklevine.comDownload Document from Source Website File Size: 84,50 KBShare Document on Facebook
|