Hartmann, Nievergelt, Reichert
Whatever
is calculable, can be assessed by a Turing-Machine!
Alonzo Church
(click for other projects) |
|
|
|
|
|
|
|||||
| There
exists no Turing-Machine, which is able to decide if any other Turing-Machine
ever stops or not. Hartmann, Nievergelt, Reichert Whatever
is calculable, can be assessed by a Turing-Machine! |
|||||
|
|||||
| click to enter | Project space (click for other projects) | ||||