Re:GIMPS Project Discovers Largest Known Prime Number
by fooker on Wednesday January 03, 2018 @11:38PM
(#16068080)
The description of a Turing machine that can do arbitrarily large computations can be finite.
See: Kolmogorov complexity.
Re:GIMPS Project Discovers Largest Known Prime Number
by schoen on Thursday January 04, 2018 @12:34AM
(#16068288)
Sure, 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.
https://en.wikipedia.org/wiki/Limits_of_computation
https://en.wikipedia.org/wiki/Transcomputational_problem