David Levine () (UCLA) Balázs Szentes () (University of Chicago)
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.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Publisher Info
Article provided by Economics Bulletin in its journal Economics Bulletin.
Find related papers by JEL classification: A0 - General Economics and Teaching - - General A1 - General Economics and Teaching - - General Economics
References listed on IDEAS Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.: