Bruno Marchal wrote:
Now I think I should train you with diagonalization. I give you an
exercise: write a program which, if executed, will stop on the biggest
possible natural number. Fairy tale version: you meet a fairy who
propose you a wish. You ask to be immortal but the fairy
Bruno writes:
Meanwhile just a few questions to help me. They are hints for the=20
problem too. Are you familiar with the following recursive program=20
for computing the factorial function?
fact(0) =3D 1
fact (n) =3D n * fact(n - 1)
Could you compute fact 5, from that program? Could you
2 matches
Mail list logo
