|
|
|
|
|
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. |
|
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.