A Turing test for free will

DOI10.1098/RSTA.2011.0331zbMath1321.81005arXiv1310.3225OpenAlexW2090328157WikidataQ51353321 ScholiaQ51353321MaRDI QIDQ2941605

Seth Lloyd

Publication date: 21 August 2015

Published in: Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1310.3225

zbMATH Keywords

computational complexityquantum mechanicsfree willTuring test

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) General and philosophical questions in quantum theory (81P05) Markov and semi-Markov decision processes (90C40) Physics (00A79)

Related Items (2)

The foundations of computation, physics and mentality: the Turing legacy ⋮ The machine as data: a computational view of emergence and definability

Cites Work

• Unnamed Item
• The free will theorem
• Most programs stop quickly or never halt
• Universal Quantum Simulators
• On the Computational Complexity of Algorithms
• On Computable Numbers, with an Application to the Entscheidungsproblem

This page was built for publication: A Turing test for free will