|
Some problem's undecidability is proved by constructing a contradiction.(e.g. halting problem)
Can we say that "The contradiction is the limit of computing"?
We cannot compute something because when we do the "computing", a contradiction appears. The contradiction is all accroding to Aristotle's Logic. So can we say that "The limit of computing is Aristotle's Logic"? |
|