3 ms·
What's Q? They lost me there. A is all computable functions in... Something? Also, if Turing completeness indicates that a language can simulate any mechanical
by OtterCoder 9y ago
What's Q? They lost me there. A is all computable functions in... Something?
Also, if Turing completeness indicates that a language can simulate any mechanical process, and any Turing complete language must be Gödel incomplete, then that means there must be some physical facts that are simply inexpressible?
- asynchrony 9y agoNot inexpressible. Unprovable. There could be a set of correct programs that could never be proven correct by a type checker, for example.
- dvt 9y agoQ is the set of all functions that take an integer as an input and return a 0 or a 1. A is the set of all function in Q that are computable.