Can A Turing Player Identify Itself?

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.

MoreLess

Year of publication:	2006
Authors:	Levine, David ; Szentes, Balázs
Published in:	Economics Bulletin. - AccessEcon, ISSN 1545-2921. - Vol. 1.2006, 1, p. 1-6
Publisher:	AccessEcon
Subject:	Economic Theory

More details

Extent:	application/pdf
Type of publication:	Article
Language:	English
Classification:	A1 - General Economics
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10005110778