Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | |||
|
aa:ct:models [2019/10/07 21:28] costin.lupu.almighty |
aa:ct:models [2019/10/08 07:55] (current) costin.lupu.almighty |
||
|---|---|---|---|
| Line 291: | Line 291: | ||
| In what follows, we examine the **Church-Turing Thesis** which is an **argument** for using the Turing Machine as a computational model: | In what follows, we examine the **Church-Turing Thesis** which is an **argument** for using the Turing Machine as a computational model: | ||
| - | //Any problem which can be solved byh the Turing Machine is //"universally solvable"//.// | + | //Any problem which can be solved by the Turing Machine is //"universally solvable"//.// |
| The term //"universally solvable"// cannot be given a precise mathematical definition. We only know solvability w.r.t. a given model of computation (abstract or concrete). | The term //"universally solvable"// cannot be given a precise mathematical definition. We only know solvability w.r.t. a given model of computation (abstract or concrete). | ||