File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Can a turing player identify itself?

TitleCan a turing player identify itself?
Authors
Levine, DavidSzentes, Balázs
Issue Date2006
Citation
Economics Bulletin, 2006, v. 1, n. 1 How to Cite?
AbstractWe 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 Identifierhttp://hdl.handle.net/10722/329303

 

DC FieldValueLanguage
dc.contributor.authorLevine, David-
dc.contributor.authorSzentes, Balázs-
dc.date.accessioned2023-08-09T03:31:50Z-
dc.date.available2023-08-09T03:31:50Z-
dc.date.issued2006-
dc.identifier.citationEconomics Bulletin, 2006, v. 1, n. 1-
dc.identifier.urihttp://hdl.handle.net/10722/329303-
dc.description.abstractWe 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.languageeng-
dc.relation.ispartofEconomics Bulletin-
dc.titleCan a turing player identify itself?-
dc.typeArticle-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.scopuseid_2-s2.0-84892875713-
dc.identifier.volume1-
dc.identifier.issue1-
dc.identifier.eissn1545-2921-

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats