On 9/15/2016 4:29 PM, Stephen Paul King wrote:
On Thu, Sep 15, 2016 at 6:47 PM, Brent Meeker <meeke...@verizon.net <mailto:meeke...@verizon.net>> wrote: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 theoriesI 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? Yes, sorta.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. It has itself as an input. :-P
I suppose you can think of it as a null input. But it also has not output. It doesn't halt. So I'm not sure what you mean by computing one algorithm efficiently and correctly.
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 everything-list+unsubscr...@googlegroups.com. To post to this group, send email to everything-list@googlegroups.com. Visit this group at https://groups.google.com/group/everything-list. For more options, visit https://groups.google.com/d/optout.
