On Monday, June 3, 2019 at 2:35:27 AM UTC-5, Bruno Marchal wrote: > > > Computer science is concerned a lot with non computable notions. > 99,9999999 % of the arithmetical is highly not computable, but plays a key > role in the machine’s self”s phenomenology. Löbian machine (i.e. universal > machine aware of their universality, like PA) cannot predict their own > behaviour, and they know that, giving them a base for a (compatibilist) > notion of free-will. > > Recursion theory is often named “computability theory”, but it is mainly a > theory of degrees of non computability. > > All this was (is) well known in mathematical logic and theoretical > computer science. I can explain more on this if people asks me. > > To be sure, this week I have many oral exams (June period), so apology for > possible delays in comment. > > Bruno > > I question whether chemistry can be (completely) reduced to numerical mathematics (or computing).
@philipthrift -- 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 view this discussion on the web visit https://groups.google.com/d/msgid/everything-list/ee20f885-fb7c-4a76-a925-f1cfa547f685%40googlegroups.com.
