Quote: Church's definitions of effective calculability include algorithms and a large class of provable theorems in a system of symbolic logic

Quotation Skeleton

Thus it is shown that no more general … which naturally suggest themselves (1) by defining a … (2) by defining a function F (of one … integer n such that F(m)=n is a provable … [in some particular system of symbolic logic].   Google-1   Google-2

Copyright clearance needed for quotation.

Related Topics

Topic: Turing machine (30 items)