Feasible Functions ∗


It is common to identify the class of computable functions with the class of functions computable by the Turing machine. The identification is done on the ground of the famous Church-Turing thesis. In fact, the thesis justifies only one implication: computable function are Turing computable. The other implication is quite obviously false if computability… (More)


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics