4
votes
Halting Problem Oracle
The Halting Problem is the problem of constructing a Turing Machine (TM) that, given any other Turing Machine, M, as input, along with additional input D, will tell you whether if you feed D to M, M ...
- 13.1k
1
vote
Accepted
Scrutiny on the definition of the Turing Machine?
... the time evolution of the electric field is given by Maxwell's equations ... so it's not obvious to me they will have the same computational power
I think the underlying distinction you're trying ...
- 585
1
vote
Scrutiny on the definition of the Turing Machine?
Short Answer
Yes. Absolutely. Philosophers wrestle over these sorts of phrases to tackle the metaphysics of computation endlessly.
Long Answer
Since 1936, the notion of Turing machines and effectively ...
- 35.6k
1
vote
How can the quality of "something being very improbable" be used as a philosophical argument?
My 0.1 cent.
Assuming we live in a simulation, the "waste of time" argument is flawed since our time unit can be vastly different than the real time unit, ie 1 billion years our time may ...
- 2,948
1
vote
How can the quality of "something being very improbable" be used as a philosophical argument?
Yes, I do understand the "colossal waste of time" reasoning. So far, the simulation we live in- assuming we live in one- seems to have been running for more than thirteen billion years, ...
- 26.4k
1
vote
Accepted
A universal construction on some data D
It’s the Church-Turing Thesis.
As an overview (which I do not fully understand), Alonzo Church and Alan Turing both independently proved something about “construction”, “generation”, or even I think ...
- 3,924
1
vote
The Relationship between the Church–Turing Thesis and Physical Computation
Suppose there is a physical process that allows for the calculation of functions not computable by any Turing machine ("Physical process” is any process that is in accordance with the actual laws ...
- 18.9k
1
vote
The Relationship between the Church–Turing Thesis and Physical Computation
The phrasing itself implies that there may exist functions that can be calculated, can't be calculated by an effective method, and aren't Turing-compatible, otherwise there's no need for the qualifier ...
- 8,413
Only top scored, non community-wiki answers of a minimum length are eligible