Le 17-déc.-07, à 19:04, meekerdb (Brent Meeker) wrote:
Bruno wrote:
Exercise:
What is wrong with the following argument. (I recall that by
definition
a function from N to N is defined on all natural numbers).
(false) theorem: the set of computable functions from N to N is not
Bruno--
Ahh, my amateur status is nakedly exposed. I'm going to expose my
confusion even further now.
Never heard of a universal language. I thought I was familiar with
Church's thesis, but apparently no. I thought it was the claim that
two or three or four concepts (including recursive
2 matches
Mail list logo
