3 ms·
> As it stands, we don't even know of any functions that exceeds the Turing complete, but are computable. That would require the universe to be discrete, we do
by Jensson 2y ago
> As it stands, we don't even know of any functions that exceeds the Turing complete, but are computable.
That would require the universe to be discrete, we don't know that. Otherwise most continuous processes compute something that a Turing machine can't, the Turing machine can only approximate it.
- vidarh 2y agoYou can compute with values that are not discrete just fine by expressing them symbolically. I can't write out 1/3 as a discrete value in base 10, but I can still compute with it just fine.