Hi guys and girls, I have a question about the concept of the universal dovetailer. I understand that the necessity to postulate the UD follows from the Halting Problem (HP): since there are uncomputable functions from N to N, and since because of the HP there is no algorithm for deciding which functions are computable, we need a UD to dovetail all possible functions zigzag-style.
Now my question is: Does this mean that the UD dovetails all possible functions, including the uncomputable ones? -- 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.
