Oracle Machines and the Verification Problem

-
Florent Franchette presented an interesting problem in his "Oracle Hypermachines Faced with the Verification Problem". Franchette argues that a physical oracle machine cannot be used to prove that physical hypercomputers exist simply because we cannot verify the results computed by the machine. However, an answer to what can be computed by a form of oracle Turing machine is described in "Computational complexity with experiments as oracles" (see also "Computational complexity with experiments as oracles. II. Upper bounds"). Roughly, their oracle machine, which is called an analog-digital Turing machine, is an ordinary Turing machine coupled to an abstract physical experiment. The authors of these papers prove that this machines have computational power that goes beyond the Church-Turing barrier. Now, if one proves that a machine is actually a hypercomputer, then I think there is no need to verify results computed. After all, we trust the results computed by ordinary machines, so why shouldn't we  trust the results computed by a hypercomputer?

Σχόλια

Δημοσίευση σχολίου

Δημοφιλείς αναρτήσεις από αυτό το ιστολόγιο

A comment on a comment

-
Recently, "someone" posted a review of my book on hypercomputation on the Brains site. The reviewer argues that This area is full of problems, some of which are physico/mathematical and some of which are conceptual. Unfortunately, from a quick sample, Syropolous's book does not avoid common mistakes and confusions—some of which I've been trying to correct in my own work. First of all, I have to admit that back in 2004 I read a paper by this reviewer, but at that time I did not considered it interesting. However, after I read this review of my book, I read The Physical Church-Turing Thesis: Modest or Bold? , the reviewer's latest manuscript, in order to see what he meant by common mistakes and confusions and how he was trying to solve them. In this manuscript, the reviewer puts forth a number of criteria that every machine has to satisfy in order to be ``useful for physical computing.'' These criteria are: Readable Inputs and Outputs Process-Independ
Διαβάστε περισσότερα

Is the Universe a Quantum Computer?

-
 The idea that the Universe (whatever we may mean by this) is a some sort of a computer is a recurring theme. Recently, Nature published an article by David L. Chandler that is entitled Could the Universe be a giant quantum computer? This article is actually a tribute to Edward Fredkin, who passed away last June. The main contribution of Fredkin to the philosophy of science is his "digital philosophy" that advocates the idea that the universe is a computer and everything in our universe is discrete. I would not like to argue against the validity of these ideas (I have done so in Hypercomputation: Computing Beyond the Church-Turing Barrier and in Demystifying Computation: A Hands-On Introduction ) . However, I would like to point out that if the Universe is not a computing device, in general, then it cannot be a quantum computer, in particular. Also, what I did not like with Chandler's article is that it takes it for granted that the Universe is a computer. He did not e
Διαβάστε περισσότερα

Turing Machine Simulation

-
 Hypercomputation is about machines that transcend the computational power of the Turing machine. However, I think it is quite instructive to really understand the power of the Turing machine. Therefore, I think play with a Turing machine simulator is quite instructive. The Turing machine simulator by Martín Ugarte is a very interesting and powerful simulator that I recommend to everyone who wants to play with Turing machines.
Διαβάστε περισσότερα