Welcome!
Hello, Ad88110, and welcome to Wikipedia! Thank you for your contributions. I hope you like the place and decide to stay. Here are some pages that you might find helpful:
I hope you enjoy editing here and being a
Wikipedian! Please
sign your messages on
discussion pages using four
tildes (~~~~); this will automatically insert your username and the date. If you need help, check out
Wikipedia:Questions, ask me on
my talk page, or ask your question on this page and then place {{helpme}}
before the question. Again, welcome! --
Anna Lincoln (
talk)
08:42, 15 May 2009 (UTC)
Yes, Entscheidungsproblem is definitely mathematics. I'm not sure why it is in Philosophy. Rick Norwood ( talk) 15:46, 19 May 2009 (UTC)
I'm not sure I understand the question but, yes Gödel's incompleteness theorem is very important to the philosophy of mathematics, as is Turing's theorem. Both represent discoveries of things that are, by their very nature impossible or unknowable. A third example is the homomorphism problem in the area of group representations. There not only is not, but by the nature of group representations there can never be an algorithm that will in all cases determine if two representations represent homomorphic groups. Rick Norwood ( talk) 13:06, 20 May 2009 (UTC)
Welcome!
Hello, Ad88110, and welcome to Wikipedia! Thank you for your contributions. I hope you like the place and decide to stay. Here are some pages that you might find helpful:
I hope you enjoy editing here and being a
Wikipedian! Please
sign your messages on
discussion pages using four
tildes (~~~~); this will automatically insert your username and the date. If you need help, check out
Wikipedia:Questions, ask me on
my talk page, or ask your question on this page and then place {{helpme}}
before the question. Again, welcome! --
Anna Lincoln (
talk)
08:42, 15 May 2009 (UTC)
Yes, Entscheidungsproblem is definitely mathematics. I'm not sure why it is in Philosophy. Rick Norwood ( talk) 15:46, 19 May 2009 (UTC)
I'm not sure I understand the question but, yes Gödel's incompleteness theorem is very important to the philosophy of mathematics, as is Turing's theorem. Both represent discoveries of things that are, by their very nature impossible or unknowable. A third example is the homomorphism problem in the area of group representations. There not only is not, but by the nature of group representations there can never be an algorithm that will in all cases determine if two representations represent homomorphic groups. Rick Norwood ( talk) 13:06, 20 May 2009 (UTC)