Turing tests with Turing machines

DOI10.29007/9N7DMaRDI QIDQ6874955zbMATH OpenFDO

Authors J. Hernández-Orallo, Javier Insa-Cabrera, David L. Dowe, Bill Hibbard

Publication date 14 January 2026

Full work available at URL https://doi.org/10.29007/9N7D

zbMATH Keywords

game theoryhuman unpredictabilityimitation gamesintelligencelearningmatching penniesSolomonoff-Kolmogorov complexityTuring machinesTuring test

Mathematics Subject Classification ID

Classical models of computation (Turing machines, etc.) (68Q04) General topics in artificial intelligence (68T01) Applications of game theory (91A80)

Cites work

• A formal theory of inductive inference. Part II
• An Information Measure for Classification
• Beyond the Turing test
• Computing machinery and intelligence
• Gödel's theorem and information
• scientific article; zbMATH DE number 3427210 (Why is no real title available?)
• scientific article; zbMATH DE number 2188025 (Why is no real title available?)
• Language identification in the limit
• Minimum Message Length and Kolmogorov Complexity
• On the Length of Programs for Computing Finite Binary Sequences

This page was built for publication: Turing tests with Turing machines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6874955)