3 ms·
The description of a Turing machine that can do arbitrarily large computations can be finite. See: Kolmogorov complexity.
by fooker 9y ago
The description of a Turing machine that can do arbitrarily large computations can be finite.
See: Kolmogorov complexity.
- schoen 9y agoSure, but it feels a little funny in one way to say that people "know" all of its output, although I'd agree that for other purposes being able to write a program to generate something is a relatively good description of what it means to understand it.