On 10/3/2018 1:10 AM, Bruno Marchal wrote:
Consider any digital machine. It corresponds to some number k (such
that phi_k(x) = y describes the behaviour of the machine k) (digital
machine are recursively enumerable).
The theology of the machine k is define by the set of all true
sentence about k. That includes the sentences that k is able to prove
(relatively to the base phi_i) *and* the sentences which are true
about k, but that k cannot prove.
With mechanism, you can define theology by the difference between
computer science and computer’s computer science.
You can define it by Tarski’s notion of truth minus Gödel’s notion of
probability.
I assume you meant "provability".
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.
