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)Reply

Hi, Ad88110. You can contact a member of WikiProject Philosophy (list here) and/or a member of WikiProject Mathematics (list here). A WikiProject is a group of users who are interested in a topic, and they also manage the related portal. Explain the problem to them and I'm sure they'll solve it. I'd like to fix the issue directly, but I'm not an expert on the matter. The lists are large, but you can read the descriptions and pick up somebody who is related to the concrete area of the topic. Good luck! --Anna Lincoln (talk) 11:19, 19 May 2009 (UTC)Reply

Memo

edit
Ok, users User:CBM (Math.) and User:Rick_Norwood (Philos.& Math.) have won the problem. Ad88110 (talk) 14:57, 19 May 2009 (UTC)Reply

Turing

edit

Yes, Entscheidungsproblem is definitely mathematics. I'm not sure why it is in Philosophy. Rick Norwood (talk) 15:46, 19 May 2009 (UTC)Reply

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)Reply