The group you are posting to is a Usenet group. Messages posted to this group will make your email address visible to anyone on the Internet.
Your reply message has not been sent.
Your post was successful
> Well, wouldn't the natural genralization of T-predicate be something aInteresting idea but I think it is important that computations are
> relation T(n,m,a) where n is the machine code, n is the input, and a
> is whatever it takes to describe a computation? So what does describe
> a computation? A map from a countable ordinal to the Cantor space
> could do it. The important thing is to make T decidable in the topos,
> and as long as the type of a is overt, we'll be able to do the usual
> things with the T predicate, no?
coded by natural numbers as well. At least in relative computability
that is still the case.
You must Sign in before you can post messages.
To post a message you must first join this group.
Please update your nickname on the subscription settings page before posting.
You do not have the permission required to post.