On 9/15/2016 11:03 AM, Stephen Paul King wrote:
I get that and buy it too, Brent. Platonia is the "flat" Complete
version, I am looking for the infinite tower of incomplete yet
consistent theories
I don't understand what you mean by that. I assume "theories" refers to
axiomatic systems. If I take one such system, like arithmetic, I can
keep adding the unprovable Godel sentences as axioms and so create an
unbounded "tower" of systems. Is that what you mean?
and trying to make sense of computational languages that could use
those theories. Remember that computers do not need to be Turing
Complete if they only need to compute one algorithm efficiently and
correctly.
That's the view of an algorithm as computing a function; so given an
input there is a certain correct output. But the UD doesn't have any input.
Brent
This seems to be an attack on the UD, which requires computational
universality, but I assure you that it is very Digital Mechanism
friendly. I am after Correct computers, not Universal computers. An
example of such is the TauChain.
On Thu, Sep 15, 2016 at 1:54 PM, Brent Meeker <[email protected]
<mailto:[email protected]>> wrote:
According to Bruno it's in Platonia. It's timeless and doesn't
"go", it just IS, like 2+2 IS 4.
Brent
--
You received this message because you are subscribed to the Google Groups
"Everything List" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at https://groups.google.com/group/everything-list.
For more options, visit https://groups.google.com/d/optout.
