Notion of calculability:
A function of positive integers is calculable only if recursive.
Calculable function ( in a objective meaning) as used in Church-Turing Thesis http://plato.stanford.edu/entries/church-turing/
|
3 | added 4 characters in body | ||
|
|
||||
|
|
2 | deleted 51 characters in body | ||
|
Notion of calculabilityas notion used in Church-Turing Thesis:
Calculable function ( in a objective meaning) as used in Church-Turing Thesis http://plato.stanford.edu/entries/church-turing/ |
||||
|
|
1 | [made Community Wiki] | ||
|
Notion of calculability as notion used in Church-Turing Thesis:
Calculable function ( in a objective meaning) as used in Church-Turing Thesis http://plato.stanford.edu/entries/church-turing/ |
||||
