Can A Turing Player Identify Itself?

David Levine and Balázs Szentes ()
Additional contact information
Balázs Szentes: University of Chicago

Economics Bulletin, 2006, vol. 1, issue 1, 1-6

Abstract: 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 (search for similar items in EconPapers)
JEL-codes: A0 A1 (search for similar items in EconPapers)
Date: 2006-03-23
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.accessecon.com/pubs/EB/2006/Volume1/EB-06A00001A.pdf (application/pdf)

Related works:
Working Paper: Can A Turing Player Identify Itself? (2006)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ebl:ecbull:eb-06a00001

Access Statistics for this article

More articles in Economics Bulletin from AccessEcon
Bibliographic data for series maintained by John P. Conley ().