| 
|
Quote: Church proposed lambda functions and recursive functions as equivalent definitions of effectively calculable. These widely different definitions support his thesis
topics >
all references >
references c-d >
Topic:
Turing machine
Quotation Skeleton
As will appear, this definition of effective calculability … shall be called effectively calculable if it is … , [or] (2) … it is recursive … The fact … that two such widely different and (in the … to the strength of the reasons adduced below … the usual intuitive understanding of it. Google-1 Google-2
Copyright clearance needed for quotation.
Topic: Turing machine (30 items)