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 significa - Undecidable problem - Document - PDFSEARCH.IO

First Page	Meta Content
	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 significa Add to Reading List Document Date: 2006-03-16 11:03:47 Open Document File Size: 84,50 KB Share Result on Facebook City Chicago / Oxford / / Country United States / / / Facility University of Chicago / / / IndustryTerm opponents algorithm / / Organization UCLA / UCLA / Los Angeles / The University of Chicago / Department of Economics / National Science Foundation / Foundation of Game Theory / / Person Basil Blackwell / IDENTIFY ITSELF / Nash Equilibrium / DAVID K. LEVINE / David K Levine / / / Position hb / Corresponding Author / TURING PLAYER / / ProvinceOrState Illinois / California / / PublishedMedium Journal of Theoretical Biology / Journal of Economic Theory / / Technology opponents algorithm / / SocialTag Applied mathematics Alan Turing Turing machine Theory of computation Models of computation Computability NP Machine that always halts Halting problem Theoretical computer science

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 List