This question already has an answer here:
- Human computing power: Can humans decide the halting problem on Turing Machines? 10 answers
are undecidable problems also unsolvable for humans? I mean I would think I could tell by reading the code of a program if it will halt for a certain input (which would solve the haltingproblem).
This will be very hard for large programs of course, but still solvable. But then this would mean, a Turing machine can’t get as smart as a human.
This is probably a dumb question, but I don’t find anything online.