File Download
There are no files associated with this item.
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Article: Can a turing player identify itself?
Title | Can a turing player identify itself? |
---|---|
Authors | |
Issue Date | 2006 |
Citation | Economics Bulletin, 2006, v. 1, n. 1 How to Cite? |
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. |
Persistent Identifier | http://hdl.handle.net/10722/329303 |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Levine, David | - |
dc.contributor.author | Szentes, Balázs | - |
dc.date.accessioned | 2023-08-09T03:31:50Z | - |
dc.date.available | 2023-08-09T03:31:50Z | - |
dc.date.issued | 2006 | - |
dc.identifier.citation | Economics Bulletin, 2006, v. 1, n. 1 | - |
dc.identifier.uri | http://hdl.handle.net/10722/329303 | - |
dc.description.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. | - |
dc.language | eng | - |
dc.relation.ispartof | Economics Bulletin | - |
dc.title | Can a turing player identify itself? | - |
dc.type | Article | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.scopus | eid_2-s2.0-84892875713 | - |
dc.identifier.volume | 1 | - |
dc.identifier.issue | 1 | - |
dc.identifier.eissn | 1545-2921 | - |