Hacker News new | ask | show | jobs
by naasking 2730 days ago
> Can you provide some logic against that argument?

Turing machines are deterministic. Enumerating all Turing machines is deterministic. Whether any given Turing machine will terminate is unpredictable (the Halting problem).

Unpredictability does not entail nondeterminism, although distinguishing the two is not necessarily always possible.

1 comments

But turing machines are theoretical concepts. The physical processors we have - are only physical approximations of a theoretical concepts - and if the argument was made for the view of "determinism" that I outlined - it would be about the physical processor, the physical world itself.

Paraphrasing, the theoretical image of an atom, as well as the set of atoms and other particles - is perfectly deterministic. But the chaos theory talks about the real world, not the theoretical framework.

The concept of determinism has no physical limits. Don't try to redefine standard terminology.
The concept has no limits, true. The physical world does.