I found Internet resources a bit confusing, so I ask this question:
What are Wittgenstein's arguments on algorithm decidability and Godel's Incompleteness Theorem?
I found Internet resources a bit confusing, so I ask this question:
What are Wittgenstein's arguments on algorithm decidability and Godel's Incompleteness Theorem?
Wittgenstein's arguments about Gödel's Incompleteness Theorem are found in his Lectures on the Foundations of Mathematics.
There have been several recent papers trying to assess Wittgenstein's comments; for example, here and here.
Are you finding the arguments in these sources unclear?