> > Charlie-Boo <shymath...@gmail.com> writes:
> > > 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?

> Good question.  How about if we add, "There is a recursive function
> 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"
> >  - Ludwig Wittgenstein, Tractatus Logico-Philosophicus