3 ms·
Very amateurish. Why even talk about clockspeed of a machine, that can run any countable set of Turing programs in a single tick? That does not make any sense.
by lostmsu 8y ago
Very amateurish. Why even talk about clockspeed of a machine, that can run any countable set of Turing programs in a single tick? That does not make any sense.
Also, claim, that such a machine is physically impossible in our Universe is unsubstantiated (thought very likely).
- jandrese 8y agoIt's not hard to conceive of an algorithm that, when using the smallest possible unit of energy per step, requires more energy than exists in the known universe.
- lostmsu 8y agoI don't understand your suggestion. Where does the assumption, that each "step" directly maps to energy consumption of some physical machine? Does not that basically rest on the assumption, that no machine can run infinite Turing machine steps with finite energy?
- jandrese 8y agoIt seems self evident that you can not run an infinite process in a finite universe. The laws of entropy are your enemy. In this case the process is not "infinite", but is larger than your universe. An example is trying to brute force an encryption algorithm. You figure out the minimal amount of energy that could be used to compute each step, in terms of electron state changes or some other fundamental unit. Then you calculate the quantity of energy in the universe (assuming mass gets converted into energy as per E=MC^2 and all energy is put in some form you can use) and compare that against the energy per step * problem space. If the latter is larger then you can say that even though the problem is finite, there is not enough resources in the universe to discover the solution.
- lostmsu 8y agoNow you are assuming, that the Universe has countable size.