-2

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?

4
  • 3
    Could you, perhaps, explain a bit further how did your question come up? Can you contextualize the problem stating what you already know about it?
    – Tames
    Jul 17, 2012 at 16:11
  • 3
    The body of your question should add background and context to your title question, not simply repeat it. Can you tell us anything at all you know about these two things, where exactly you are being tripped up, etc.?
    – stoicfury
    Jul 17, 2012 at 17:12
  • 4
    What sources were you reading that were confusing? Jul 17, 2012 at 19:18
  • It was totally incorrect that this question was closed for a lack of focus, at least with regarding Wittgenstein's arguments on Godel's Incompleteness Theorem. Wittgenstein's Wittgenstein's " notorious paragraph " about the Gödel Theorem is very well known.
    – polcott
    May 10, 2020 at 17:35

1 Answer 1

2

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?

1
  • Because I came up with Wittgenstein's exact same reasoning independently on my own before I ever heard of him I understand it completely. I will sum up a concise paraphrase of it. Unless an expression of language can be proved true or false it is simply not a truth bearer.
    – polcott
    Feb 14, 2023 at 4:35

Not the answer you're looking for? Browse other questions tagged .