On 22-7-2009 23:21, somebody wrote:
> "Warp" <war### [at] tag povray org> wrote in message
> news:4a676772@news.povray.org...
>> somebody <x### [at] y com> wrote:
>
>>> Even so, one has to be careful, for it's possible to determine if any
> such
>>> finite program will halt or not - just run the program until all
> possible
>>> states would be exhausted.
>
>> A finite program might never exhaust all possible states with unbounded
>> memory.
>
> True in that Turing machines do have unbounded memory. Of course no real
> machine does or will.
A Turing machine with unspecified memory size will do. Aside: Your cell
phone's state space far exceeds the number of particles in the universe
multiplied by the age of the universe measured in Plack times. What was
your point?
Post a reply to this message
|