Misplaced Pages

User talk:Likebox

Article snapshot taken from Wikipedia with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.

This is an old revision of this page, as edited by CBM (talk | contribs) at 10:26, 16 October 2009 (→"paragraph": r). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Revision as of 10:26, 16 October 2009 by CBM (talk | contribs) (→"paragraph": r)(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Arbitration for Quantum Mysticism

You are involved in a recently-filed request for arbitration. Please review the request at Misplaced Pages:Requests for arbitration#Quantum mysticism article and, if you wish to do so, enter your statement and any other material you wish to submit to the Arbitration Committee. Additionally, the following resources may be of use—

Thanks, —Preceding unsigned comment added by Lightbound (talk • contribs) 21:02, 1 October 2009 (UTC)

Wikis Take Manhattan

Wikis Take Manhattan
Next: Saturday October 10


This box: view • talk • edit

WHAT Wikis Take Manhattan is a scavenger hunt and free content photography contest aimed at illustrating Misplaced Pages and StreetsWiki articles covering sites and street features in Manhattan and across the five boroughs of New York City.

LAST YEAR'S EVENT

WINNINGS? The first prize winning team members will get Eye-Fi Share cards, which automatically upload photos from your camera to your computer and to sites like Flickr. And there will also be cool prizes for other top scorers.

WHEN The hunt will take place Saturday, October 10th from 1:00pm to 6:30pm, followed by prizes and celebration.

WHO All Wikipedians and non-Wikipedians are invited to participate in team of up to three (no special knowledge is required at all, just a digital camera and a love of the city). Bring a friend (or two)!

REGISTER The proper place to register your team is here. It's also perfectly possible to register on the day of when you get there, but it will be slightly easier for us if you register beforehand.

WHERE Participants can begin the hunt from either of two locations: one at Columbia University (at the sundial on college walk) and one at The Open Planning Project's fantastic new event space nestled between Chinatown and SoHo. Everyone will end at The Open Planning Project:

148 Lafayette Street
between Grand & Howard Streets

FOR UPDATES

Please watchlist Misplaced Pages:Misplaced Pages Takes Manhattan. This will have a posting if the event is delayed due to weather or other exigency.

Thanks,

Pharos

You can add or remove your name from the New York City Meetups invite list at Misplaced Pages:Meetup/NYC/Invite list.
This has been an automated delivery by BrownBot (talk) 21:19, 4 October 2009 (UTC)

"paragraph"

On User_talk:RobinK, you said, "But this is it. If CBM wants this included in the text, it would take only a paragraph to insert, and it would complete the proof of Godel's theorem." I would be very interested in seeing your hypothetical paragraph that fully justifies how the language of Peano arithmetic can be extended to include all the primitive recursive functions. Such a one-paragraph proof is not known in the literature, which is why people still rely on the lengthy proofs necessary to use Gödel's β function to show that it is possible to quantify over finite sequences in PA. — Carl (CBM · talk) 01:53, 16 October 2009 (UTC)

"I was going to assume that the Godel beta-function is given, which means that you already know that the extraction of the prime exponent is allowed by first order logic and PA." This is exactly my point. An actual proof of the incompleteness theorem has to actually prove this, and that's where almost all of the work is. The actual diagonal lemma part is very short and easy, it's only the arithmetization that is difficult. But once one has established that the language includes all primitive recursive functions, the remainder of the arithmetization, such as assigning Gödel numbers to formulas and proofs, is trivial. Similarly for the second incompleteness theorem: almost all the work is in the formalization of the provability predicate within the theory at hand. Once this is done, the rest of the result is easy. — Carl (CBM · talk) 10:26, 16 October 2009 (UTC)

Foundations of Mathematics

That interests me. --Ludvikus (talk) 02:18, 16 October 2009 (UTC)