Quantum Computing Stack Exchange is a question and answer site for engineers, scientists, programmers, and computing professionals interested in quantum computing. It only takes a minute to sign up. Connect and share knowledge within a single location that is structured and easy to search. Emphasis added. As intimated by, for example, Aaronson here , a successful demonstration of sampling from a large-enough Hilbert space with a high-enough fidelity will indeed invalidate the Extended Church-Turing Thesis.
チャーチ＝チューリングのテーゼ - Wikipedia
Physics Stack Exchange is a question and answer site for active researchers, academics and students of physics. It only takes a minute to sign up. Connect and share knowledge within a single location that is structured and easy to search. The Church-Turing hypothesis says one can not build a computing device which has more computing power in terms of computability than the abstract model of Turing machine. So, there is something in our laws of physics which prevent us from making devices which are more powerful than Turing machine, so in this respect it can be viewed as a law of physics. There are two fundamental theories of physics that account for nearly all experiments and observations performed to date: general relativity and the Standard Model.
Subscribe to RSS
In computability theory , the Church—Turing thesis also known as computability thesis ,  the Turing—Church thesis ,  the Church—Turing conjecture , Church's thesis , Church's conjecture , and Turing's thesis is a hypothesis about the nature of computable functions. It states that a function on the natural numbers can be calculated by an effective method if and only if it is computable by a Turing machine. Before the precise definition of computable function, mathematicians often used the informal term effectively calculable to describe functions that are computable by paper-and-pencil methods. In the s, several independent attempts were made to formalize the notion of computability :. This has led mathematicians and computer scientists to believe that the concept of computability is accurately characterized by these three equivalent processes.
Computer Science Stack Exchange is a question and answer site for students, researchers and practitioners of computer science. It only takes a minute to sign up. Connect and share knowledge within a single location that is structured and easy to search. One class of challenges to the strong Church—Turing thesis comes from the field of analog computation.