4 ms·
You're telling me that a computer cannot simulate steps of a turing machine, one at a time? it can't store the current state of the turing machine, and the rule
by xlnt 18y ago
You're telling me that a computer cannot simulate steps of a turing machine, one at a time? it can't store the current state of the turing machine, and the rules, in memory, and use the rules to get from one state to the next?
Are you really saying that a computer with too little memory can't do it, or something like that? because it seems blatantly obvious that a computer can simulate a turing machine.
- dhs 18y agoA Turing Machine is an idealized computer. But no computer/TM can find out which of the possible 61.519 4-state TMs can write the longest string of 1's on a blank tape before halting.
- xlnt 18y agoA computer can try each TM one by one in the same way the humans did. If you're talking about the halting problem now, humans also don't know whether the TM they are manually simulating will halt eventually. And you still haven't said specifically what the thing is that the humans do and computers can't.
- dhs 18y agoNo, a computer cannot do it, due to incompleteness (Once there was a man called Kurt Gödel...) Bringsjords experiment proves that humans can "hypercompute" uncomputable functions. The great majority of functions which exist are uncomputable.