Skip to main content
Article thumbnail
Location of Repository

Can a Turing Player identify itself?.

By D. Levine and B. Szentes

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.

OAI identifier: oai:RePEc:ner:ucllon:http://discovery.ucl.ac.uk/17383/
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://discovery.ucl.ac.uk/173... (external link)
  • http://discovery.ucl.ac.uk/173... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.