Related papers: A Turing test for free will
Contrary to the classical case, the relation between quantum programming languages and quantum Turing Machines (QTM) has not being fully investigated. In particular, there are features of QTMs that have not been exploited, a notable example…
We show that quantum game theory offers solution to the famous Newcomb's paradox (free will problem). Divine foreknowledge is not necessary for successful completion of the game because quantum theory offers a way to discern human…
Capacity of conscious agents to perform genuine choices among future alternatives is a prerequisite for moral responsibility. Determinism that pervades classical physics, however, forbids free will, undermines the foundations of ethics, and…
Is quantum mechanics about 'states'? Or is it basically another kind of probability theory? It is argued that the elementary formalism of quantum mechanics operates as a well-justified alternative to 'classical' instantiations of a…
We describe the Turing Machine, list some of its many influences on the theory of computation and complexity of computations, and illustrate its importance.
The Church-Turing thesis is one of the pillars of computer science; it postulates that every classical system has equivalent computability power to the so-called Turing machine. While this thesis is crucial for our understanding of…
Free will is sometimes summarised in the philosophical literature as the subjective impression felt by an individual that he or she is the ultimate source or cause of his or her own choices. The two most common arguments for denying the…
Quantum theory (QT) has been confirmed by numerous experiments, yet we still cannot fully grasp the meaning of the theory. As a consequence, the quantum world appears to us paradoxical. Here we shed new light on QT by being based on two…
The Turing machine, as it was presented by Turing himself, models the calculations done by a person. This means that we can compute whatever any Turing machine can compute, and therefore we are Turing complete. The question addressed here…
Randomness is intrinsic to quantum mechanics; the outcome of a measurement on a quantum state is a random variable. This feature has been applied to randomness certification, where one party must decide whether the data they receive is…
Quantum uncertainty is a well-known property of quantum mechanics that states the impossibility of predicting measurement outcomes of multiple incompatible observables simultaneously. In contrast, the uncertainty in the classical domain…
We investigate the applicability of the formalism of quantum mechanics to everyday life. It seems to be directly relevant for situations in which the very act of coming to a conclusion or decision on one issue affects one's confidence about…
I show that probabilities in quantum mechanics are a measure of belief in the presence of human ignorance, just like all other probabilities. The Born interpretation of the square of modulus of the wave function arises from the interaction…
The main mystery of quantum mechanics is contained in Wheeler's delayed choice experiment, which shows that the past is determined by our choice of what quantum property to observe. This gives the observer a participatory role in deciding…
Can a Turing Machine simulate the human mind? If the Church-Turing thesis is assumed to be true, then a Turing Machine should be able to simulate the human mind. In this paper, I challenge that assumption by providing strong mathematical…
It is argued that the concept of free will, like the concept of truth in formal languages, requires a separation between an object level and a meta-level for being consistently defined. The Jamesian two-stage model, which deconstructs free…
We stress the notion of statistical experiment, which is mandatory for quantum mechanics, and recall Ludwig's foundation of quantum mechanics, which provides the most general framework to deal with statistical experiments giving evidence…
Is there any hope for quantum computing to challenge the Turing barrier, i.e. to solve an undecidable problem, to compute an uncomputable function? According to Feynman's '82 argument, the answer is {\it negative}. This paper re-opens the…
Beginning with Turing's seminal work in 1950, artificial intelligence proposes that consciousness can be simulated by a Turing machine. This implies a potential theory of everything where the universe is a simulation on a computer, which…
We investigate the computational power of particle methods, a well-established class of algorit hms with applications in scientific computing and computer simulation. The computational power of a compute model determines the class of…