On 1/21/2014 4:33 AM, Bruno Marchal wrote:
That is already present in Gödel 1931, and today we know that even just one diophantine (on integeres) polynomial of degree four can emulated all computations; or be Turing universal.
Just to check that I understand what that means: There is a diophantine equation such that you can parse a solution set of the equation into an input and a result such that the set of all such solutions sets correspond to all possible functions (in arithmetice). Right?
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 http://groups.google.com/group/everything-list. For more options, visit https://groups.google.com/groups/opt_out.
