|
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
 |
Newsgroups: sci.math, sci.logic
From: Charlie-Boo <shymath...@gmail.com>
Date: Sat, 31 Oct 2009 12:17:53 -0700 (PDT)
Local: Sat, Oct 31 2009 7:17 pm
Subject: Re: Characterization of a Programming Language (Base of Computing)
On Sep 16, 9:51 am, Aatu Koskensilta <aatu.koskensi...@uta.fi> wrote:
> Charlie-Boo <shymath...@gmail.com> writes: Good question. How about if we add, "There is a recursive function > > Define a 2-place relation R as being a Base of Computing if for every > > r.e. set P there is an N such that P(x) = R(N,x) for all x. > How do you propose to derive the parametrisation theorem from this? sub such that for all x,y,z R(sub(x,y),z)=R(x,y)."? [Sorry I just looked at this now - only 1 reply.] > In any case, look up "acceptable indexing" and weep. It didn't seem that sad. C-B > --
> Aatu Koskensilta (aatu.koskensi...@uta.fi) > "Wovon mann nicht sprechen kann, darüber muss man schweigen" 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.
| |||||||||||||