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

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: A0 - General Economics and Teaching
A1 - General Economics: General
Manuscript Received : Mar 22 2006 Manuscript Accepted : Mar 23 2006

  This abstract has been downloaded 781 times                The Full PDF of this paper has been downloaded 87731 times