Παρασκευή, 26 Δεκεμβρίου 2008
Τετάρτη, 10 Δεκεμβρίου 2008
Δευτέρα, 1 Δεκεμβρίου 2008
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-Independent Rule
- Physical Constructability
All in all, I fail to see how he can correct the problems with such views. In addition, his view is deeply mechanistic and unfortunately too simplistic.
Κυριακή, 2 Νοεμβρίου 2008
[T]he idea that physical science will be able to discover fundamental
computability limits is untenable.
A computation is carried out by concrete computational devices whose operation and capabilities are delimited by the laws of physics. It is one thing to argue that we have no idea what are the limits of computation and another to simple say that the limits of computation have nothing to do with physical reality. On the other hand, it is more than sure that there is a limit to what we can achieve with computing devices, but for the time being we simply do not know this limit. And this is exactly the essence of hypercomputation.
Τετάρτη, 1 Οκτωβρίου 2008
Τρίτη, 23 Σεπτεμβρίου 2008
- On the Church–Turing Thesis
- Early Hypercomputers
- Infinite-Time Turing Machines
- Interactive Computing
- Computing Real Numbers
- Relativistic and Quantum Hypercomputation
- Natural Computation and Hypercomputation
- The P = NP Hypothesis
- Intractability and Hypercomputation
- Socioeconomic Implications
Riemann hypothesi s is "is a conjecture that the Riemann zeta function has its zeros only at the negative even integers and complex n...
In an article that was recently posted to the arXiv and is entitled Deep Neural Networks are Easily Fooled: High Confidence Predictions fo...
Today I discovered a paper that claims to offer a solution to Thomson’s Lamp.The paper is entitled Hypercomputation, Frege, Deleuze: Solvin...
A nice review of transfinite conceptual computing devices by Philip Welch was posted to aRxin on September, 17. I think it would be intere...