Can a Turing Player identify itself?.
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.Similar works
Full text
Last time updated on 06/07/2012
This paper was published in Research Papers in Economics.
Having an issue?
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.