Levine, D.;
Szentes, B.;
(2006)
Can a Turing Player identify itself?
Economics Bulletin
, 1
(1)
pp. 1-6.
![[thumbnail of 17383.pdf]](https://discovery.ucl.ac.uk/style/images/fileicons/application_pdf.png) Preview |
PDF
17383.pdf Download (93kB) |
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.
| Type: | Article |
|---|---|
| Title: | Can a Turing Player identify itself? |
| Open access status: | An open access version is available from UCL Discovery |
| Publisher version: | http://www.accessecon.com/pubs/eb/default.aspx?pag... |
| Language: | English |
| UCL classification: | UCL > Provost and Vice Provost Offices > UCL SLASH > Faculty of S&HS > Dept of Economics |
| URI: | https://discovery.ucl.ac.uk/id/eprint/17383 |
Downloads since deposit
276Downloads
Download activity - last month
Download activity - last 12 months
Downloads by country - last 12 months
Archive Staff Only
 |
View Item |
