All Rights Reserved
AccessEcon LLC 2006, 2008.
Powered by MinhViet JSC

 
David Levine and Balázs Szentes
 
''Can A Turing Player Identify Itself?''
( 2006, Vol. 1 No.1 )
 
 
We show that the problem of whether two Turing Machines are functionally equivalent is undecidable and explain why this is significant for the theory of repeated play and evolution.
 
 
Keywords: Economic Theory
JEL:
A1 - General Economics: General Econ
 
Manuscript Received : Mar 22 2006 Manuscript Accepted : Mar 23 2006

  This abstract has been downloaded 1902 times                The Full PDF of this paper has been downloaded 166325 times