On Tue, Dec 04, 2007 at 03:55:50PM +0100, Bruno Marchal wrote:
>
> Hi David, Mirek, Tom, Barry and All,
>
...
>
> The cardinality of the set of computable functions.
>
Thanks for this post. I was in the position of trying to explain your
work to someone (actually a son of my mother's cousin)
On Wed, Dec 05, 2007 at 11:08:34PM +0100, Mirek Dobsicek wrote:
>
> > Each expression like that denotes now either a computable function from
> > N to N, or as we have to expect something else. And we have to expect
> > they are no computable means to distinguish which U_i represents
> > funct
Hi Bruno,
thank you for your post. I read it a couple of times in order to more or
less grasp it, but it worth it. I have some questions...
> Suppose there is a secure universal machine M. The set of expressions
> it can compute provide a secure universal language L. That set is not
> only en
3 matches
Mail list logo