3 ms·
> But surely there are uncomputable objects which you can make mathematical statements about. Absolutely, one famous example is the halting function that has t
by defrost 4y ago
> But surely there are uncomputable objects which you can make mathematical statements about.
Absolutely, one famous example is the halting function that has type (program description, program input) returns boolean.
A symbolic formal system can "reason about reason" and manipulate descriptions of objects that are themselves uncomputable, countably infinte, or even uncountably infinite.