Re: Anybody did computability theory

[Piotr Rudnicki <piotr@cs.ualberta.ca>]

Hi:

With G. Bancerek we have written an article defining the set of
primitive recursive functions and some theorems about them, the
article is almost finished and is 5000 lines long (and it has been so
for the last 2 years).  With what you write below I should then finish
is quickly now.  If you would like to see it - the article is
available on request.

Best,

PR

On Wed, Mar 14, 2001 at 09:00:29PM +0900, Chen Jingchao wrote:
>  Now I am using Mizar to write an article on computability
> theory,which includes mainly general recursive functions,
> primitive recursive functions,and Turing's theory of computing
> machine etc.  Did anybody do this work or have experiences
> with this field ?
> Any comments and suggestions will be appreciated.
> 
> Jingchao Chen
> 
> 

-- 
Piotr Rudnicki               CompSci, Univerity of Alberta, Edmonton, Canada
email: piotr@cs.ualberta.ca                 http://web.cs.ualberta.ca/~piotr