3 ms·
1. we are "computationally" equivalent to a turing machine: a tape with symbols on it and a head that reads and writes symbols to the tape according to rules.
by zzzzzzzza 4y ago
1.
we are "computationally" equivalent to a turing machine: a tape with symbols on it and a head that reads and writes symbols to the tape according to rules.
the natural generalization of a turing machine to infinity would be a hyper turing machine: an infinitely wide tape and infinitely many heads.
i think language of "god" is mostly expressed in terms of infinities. e.g. pi (most infinite numbers are inexpressible to us, since most infinite numbers are transcendental numbers)
2. The alphabet our math uses is pretty much all finite. What percent of the axioms and theorems that you know are infinitely long? Shouldn't the overwhelming majority of axioms and theorems be infinitely long (and in particular map onto an uncountable set?). It just seems natural given the circumstances.
- galaxyLogic 4y agoNo I don't believe any axioms and theorems should be infinitely long. If they were then there would not be enough time for us to understand them, or even read them through. Theorems which nobody can understand would not be useful for anything.
- zzzzzzzza 4y agothat's cuz we are computationally equivalent to a turing machine.