So all possible functions are computed equally? ISTM that some functions
would take an eternity to compute and that the number of such vastly
outnumber the recursively enumerable ones.
On Mon, May 13, 2013 at 6:24 PM, meekerdb <meeke...@verizon.net> wrote:
> On 5/13/2013 2:49 PM, Stephen Paul King wrote:
>> Does the UD compute *all* functions or only those that are recursively
> It computes all of them.
> AFAIK, the latter, as a set, has a measure zero as a subset of the
>> former. This is one reason why I worry about the viability of UDA (and
>> AUDA), it postulates a severely restricted subset of the possible functions
>> as ontologically primitive without a good argument as to why.
>> Just because we finite mortals can only counts in terms of natural
>> numbers is not an argument that All-that-Exists is limited to that
>> standard. Man is NOT the measure of all things!
> You received this message because you are subscribed to a topic in the
> Google Groups "Everything List" group.
> To unsubscribe from this topic, visit https://groups.google.com/d/**
> To unsubscribe from this group and all its topics, send an email to
> To post to this group, send email to
> Visit this group at
> For more options, visit
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 post to this group, send email to email@example.com.
Visit this group at http://groups.google.com/group/everything-list?hl=en.
For more options, visit https://groups.google.com/groups/opt_out.