|
|
|
|
|
by naniwaduni
2090 days ago
|
|
It's pretty easy to come up with "algorithms" in the intuitive sense that are not Turing computable; just violate any of the finiteness constraints. The fact that you might object to considering such procedures algorithms rests on the fact that the "thesis" is providing a definition. |
|
Unfortunately, many people don't seem to understand this.
An interesting paper related to this issue is The Myth of Hypercomputation [1]
Basically it is easy compute something that is uncomputable by using uncomputable inputs.
[1] https://link.springer.com/chapter/10.1007/978-3-662-05642-4_...