User talk:RobinK/Archive 1 - Knowledge (XXG)

2045:, a start-class article is one that is obviously incomplete and obviously lacking in reliable sources; a C-class article still lacks coverage of some of the important aspects of the subject, is inadequately referenced, and needs cleanup, and a B-class article (the standard I was aiming for in this article) is mostly complete and has no major stylistic issues. In this case I don't know of any important aspects of equitable coloring that are not covered, there are many references (in harvard parenthesized style, one of the standard styles considered acceptable on Knowledge (XXG)), and if there are major problems with the quality of my writing I'd like to know what they are. Can you explain your rating, please? — 1557:, which is not a trivial task. The language of Peano arithmetic include constants for 0 and 1, addition and multiplication functions, and the equality relation; and existantial and universal quantifiers over individual numbers. The fact that one can express in that language that a particular program halts is far from obvious. One cannot push this arithmetization inside the computer program, because the Gödel sentence must actually be a sentence in the formal theory of arithmetic under consideration. — Carl 1503:

often properly understood nowadays. Mathematicians have actively resisted language which uses computer science notions, like "memory" or "loop", requiring that any theorem be phrased in a certain way, which only uses admissible notions first presented by Godel, like "recursive function". The logic of the proofs is obfuscated enough by these language restrictions, that great theorems have been lost through obscurity. Hardly anybody understands them anymore, even though they are classics in the field.

1999:

proofs which are phrased in recursion theoretic language. This was done for political reasons: to clearly separate math and CS literature. The discussion about this separation are preserved in the logic literature. There is no reason that Knowledge (XXG) should follow mathematicians on this. Knowledge (XXG) includes mathematics and computer science equally, and for a theorem like Godel's, which belongs to both fields, one should not be allowed to elbow out the other.

1626:

involving only writing an integer I in the form I= 2^a0 3^a1 5^a2 7^a3 ,etc. Any primitive recursive operation on the finite sequence a0,a1,a2,...,ak is an operation on I which can be written in terms of addition and multiplication only (essentially because finding the ak's can be expressed in a finite way in logic using only the idea of multiplication). Then any instruction set of a modern computer can be expressed as an operation on a0,a1,...,ak.

31: 1678:

in print, in a paper or book, written by someone else? If you can provide verifiable sources which have your proof, that would be great. If not, and you are the only person to have ever come up with this, then please go ahead and publish it. If neither is the case (i.e., lots of people know this proof, but no one has written it up anywhere), then there is a good reason no one has written it up anywhere. Thus it shouldn't be on WP either. --

3859: 3786: 3713: 3317:

To use the system, you can simply edit the page as you normally would, but you should also mark the latest revision as "reviewed" if you have looked at it to ensure it isn't problematic. Edits should generally be accepted if you wouldn't undo them in normal editing: they don't have obvious vandalism,

2616:

This is one of the reasons that the term "priority" is better than "importance", which sounds much more judgmental. I don't have any sound way of determining priority for mathematician biographies, since I have only had to rate a handful of them at most. But my general opinion would be to look at the

2455:

The full list is probably not useful, since the idea is to list notable students. The references already have a link to his MathGenealogy page, which contains the full list. Usually links to uncreated pages aren't added in infoboxes; the pages are created first and then linked to. If you do add them,

2326:

Basically, I want to know whether I have to wait for a certified editor (i.e. a person who has been apppointed as editor by Wikipedians/Wikipedia governing body) to put my paper under the reference section or, alternatively, if an editor is just a Knowledge (XXG) contributor, whether it would be fine

2127:

Arguably this is at least one too many introductory articles, and various ways of dealing with this issue (by merging, moving content, deleting, etc.) have been suggested without ever coming to a consensus view. Possibly the problem is that we haven't yet answered the more fundamental question: what

1677:

I'm going to agree with CBM on this one. Let me make a very general argument. You say this proof is a lot easier than the "standard" proof which appears in many textbooks. Surely you can't have been the first person to observe this? (If you are, then please publish it.) Surely this appears some where

1625:

If you just have addition and multiplication, you need to show that a computer can be encoded using only that. It's not difficult, and it can be done in umpteen different ways. The main point is that any primitive recursive function on a sequence of integers can be written as a sentence of arithemtic

1414:

Once you know that programs manipulate integers, the specific program that performs logical deductions is obviously a special case. But Godel was writing before computers, and he had to show that logical deduction can be represented as a manipulation of integers. In order to do this, he could not use

1163:

Thanks for the answer(s). L. Hardy indeed speculates that quantum gravity theory will require infinte causal structure, and explores what that may imply for computing. I can't tell if what L. Hardy proposes implies NP-complete problems will be solvable in poly time, since space and time are no longer

943:

SuggestBot picks articles in a number of ways based on other articles you've edited, including straight text similarity, following wikilinks, and matching your editing patterns against those of other Wikipedians. It tries to recommend only articles that other Wikipedians have marked as needing work.

3492:

time?), the classic algorithm can't solve the problem as efficiently as quantum algorithm. It's a stronger example of the power of QC than the Deutsch-Jozsa algorithm. I don't quite understand the sentence either, but if you have another idea about how to capture this concept, it would be helpful. I

2188:

According to the history of quantum walk page in Knowledge (XXG), you deleted my book entry. I want to know why you did so. My book is a fully verifiable and reliable scientific source published by Morgan and Claypool, a serious editorial company. I am truly expecting an explanation as that deletion

1753:

argument is not written up this way, equivalent arguments are made often in slightly different language. You are wrong in your sociological observations. People are stupid, and don't make efforts in clarity and pedagogy as they should. Since the only innovation in the proof is pedagogical, it is not

1502:

The reason is (and I am sorry for being so long winded) that Godel's work was expanded greatly by computer scientists and computationally minded mathematicians in the 1940s,1950s and 1960s. This work, due to great mathematicians like Friedmann and Muchnik, Spencer, Post, Wang and many others, is not

1434:

Assuming that the modern notion of a computer is already understood, the first technical complexity vanishes, the computer is obvious. To get around the second technical complexity, one way is to replace the self-reference in the Godel sentence G with self-reference in a computer program. A computer

1324:

So the stuff that Aaronson describes as "an elaborate construction involving prime numbers" is still required in Aaronson's proof; Aaronson simply skips it to present a short summary. That is fine for a set of lecture notes, but not for a text nor for an encyclopedia article. Once one adds this back

1320:

To complete this step rigorously requires developing a Gödel numbering for programs, and then showing that these Gödel numbers can be manipulated via formulas in a formal theory of arithmetic. Showing this is not particularly easier or shorter than showing that it is possible to set up Gödel numbers

1272:

I cannot guarantee that I will continue to translate chunks from the German article in the near future. At the moment, my time and energy I can spend on this is very limited. So, please feel free to make changes and improvements to the structure of the article. I hope that the quality of the article

1200:

I had read Scott's paper before; it seems I forgot most of it. But on rereading it, I see that the main point regarding quantum gravity computers is that we don't know how to define what it would mean. And that he tried to do so, but doesn't have a satisfactory way of defining it. He sorta leaves it

1118:? I only have a vague understanding of this, but the argument seems to be that space and time need not be regarded as two separate resources by such a computer (see paper in first hit on gbooks). I don't feel I understand this well enough to write here (or anywhere) about it. Maybe it interests you? 1923:

In order to get a complete understanding of, Godel's theorem and Rosser's theorem from a standard textbook takes about two weeks of intensive study. Most of this time is spent re-proving obvious computer science trivialities, which are given ponderous recursion theoretic names. The final proof does

1492:

In order to incorporate these discussions into Knowledge (XXG), there is a barrier. Some people oppose any text that does not look like a textbook in a knee-jerk way, regardless of clarity or correctness. In the past, these people joined forces with people who thought that this proof "is too simple

2060:

That would be an error on my part. I was going through all the unassessed discrete math articles, and marking the non-stubby ones as either Start or B (with the simple algorithm of giving an article a B if it has refs/citations, doesn't look obviously bad and has pictures if appropriate). I should

3321:

The "reviewers" property does not obligate you to do any additional work, and if you like you can simply ignore it. The expectation is that many users will have this property, so that they can review pending revisions in the course of normal editing. However, if you explicitly want to decline the

1316:

The difficulty in the proof sketched by Aaronson is entirely in showing that statements about computer programs halting can be translated into statements about natural numbers in a way that the statements about natural numbers can be expressed within formal theories of arithmetic. Aaronson skips

3297:

system that is currently being tried. This system loosens page protection by allowing anonymous users to make "pending" changes which don't become "live" until they're "reviewed". However, logged-in users always see the very latest version of each page with no delay. A good explanation of the

1998:

Strangely enough, other subfields of mathematics don't get bogged down like this. Logic has been different, because in the 1950s and 1960s, in order to prevent encroachment on their field by computer science, mathematics purged all proofs that involve computer programs, only allowing algorithmic

1424:

Once he defines a notion of computation which is enough for his purposes (he only defines primitive recursive computations in 1931, in modern terms, he allows for-loops, but no while loops), he then constructs a Godel sentence G. This construction involves a second trick, self-reference. The two

1404:

Any person who has lived in this world has had experience with computers. Anyone who has programmed a computer at even the most rudimentary level knows that they are only manipulating integers inside. The processor makes simple changes to the memory, according to a well-defined rule which can be

2506:

It doesn't look like this discussion is going any further! Perhaps it's time to try something else. Would you object if I started by proposing a merger between the basic concepts article and the intro article? (This shouldn't stop you using text from the basic concepts article to improve the

1512:

Knowledge (XXG), in its role of preserving and tranmitting human knowledge, must fix this problem. In order to do this, text must not be deleted based on how close it is to textbooks. Text explaining intermediate steps in proofs of well known sourced results should be judged on its accuracy and

3510:

The first sentence is vague, but a fairly common interpretation of it would be that there is a random oracle separation between BQP and BPP. This is not known to be true, and conjectured to be false. The second sentence is OK, so I didn't remove it -- although I'll try to reword it to make it

3511:

clearer. The last one about the oracle being quantum and decohering makes very little sense to me. If it just means that the oracle has to allow the quantum computer to make queries in quantum superposition, then that's part of the definition of what it means to give BQP oracle access. --

3798:

is now open until 23.59 on Sunday, 10 December. All users who registered an account before Saturday, 28 October 2017, made at least 150 mainspace edits before Wednesday, 1 November 2017 and are not currently blocked are eligible to vote. Users with alternate accounts may only vote once.

2476:

My reasoning was that the closest area of mathematics to complexity theory is computability theory, and computability theory articles are all classified under mathematical logic (or should be). Mathematicians don't usually consider computability to be part of "discrete mathematics". The

2368:

Yes, I usually prefer discussions on the talk page, but if it's a specific question that you feel is inappropriate for the talk page then it's fine to have the discussion here. If it's a general question, it's usually better on the talk page since more people can read and reply to it.

3871:

is now open until 23.59 on Sunday, 3 December. All users who registered an account before Sunday, 28 October 2018, made at least 150 mainspace edits before Thursday, 1 November 2018 and are not currently blocked are eligible to vote. Users with alternate accounts may only vote once.

2337:

Finally, please accept my apologies for placing my question here (I understand you like having messages posted in the article talk area), I just thought this question of mine did not contribute to the previous discussion, about whether it was fair to cite my book or not, any longer.

1312:

It is that latter part that is the issue, both in those notes and in Likebox's edits. The part of the proof of the incompleteness theorem that uses the diagonal lemma is very short and easy; this is the part that Aaronson wants to replace by talking about the halting problem.

1321:

for formulas, as is done in the original proof. If anything, it is more difficult, because either way one has to know about formulas, but Aaronson's proof also requires proofs of a large number of facts about computability before one can prove the incompleteness theorem.

2133:

This discussion has been raised in order to generate a consensus view on this issue, which can then inform discussion of what to do with the articles. In order to avoid having the same discussion taking place on three different talk pages, please direct all comments to

1647:. 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. As it stands, the proof is complete for primitive recursive arithmetic, which is the arithmetic that people have in their heads anyway. 2580:

Actually, we should probably figure out right from the start what we mean by "extremal graph theory". The term is slightly vague, and in its most include interpretation, is much to large for one article. I would prefer being on the restrictive side of the definition.

1435:

program can talk about itself, because a computer program can print its own code. In order for a sentence G to talk about itself requires a peculiar trick involving logical variables, which is both specific to logic, and entirely equivalent to printing your own code.

610: 1846:

Well, I'm going to stick with my "sociological observations." I do believe that text book authors are intelligent people and usually professors who have had years of experience teaching courses to students. I consider their judgment to be superior in this regard.

2643:

You had asked about adding support for A-Class articles in my bot. It was a popular request and I finally implemented it as I was able to allocate some time. I added a new content type parameter that allows you to specify a category for A-Class articles. See the

1889:

You can check your sociology with a simple test: present the two proofs of the incompleteness theorems side by side to any mathematics undergraduate (or even graduate student). See which one is clearer. I have done this hundreds of times, and I already know the

3374:

H Robin. Thanks for having a go at improving this article. However in doing so you have inadvertantly reverted some of my encyclopedic tone edits. Please restore these if you can in order to avoid the use of personal pronouns such as

3725:

is open from Monday, 00:00, 21 November through Sunday, 23:59, 4 December to all unblocked users who have registered an account before Wednesday, 00:00, 28 October 2016 and have made at least 150 mainspace edits before Sunday, 00:00, 1 November 2016.

3187: 3019: 676:

I see you tagged it with a merge tag. Please start a discussion with you rationale on the talk page or the tag will get removed. By the way, it's a well-known concept in some circles e.g. operating systems or networking. (I did not read the wiki

2333:

I will work on expanding the quantum walk article regardless of whether I can see my book on the reference section now or later on, so this question is not about my willingness to do as told, but only about doing what I am truly expected to do.

2142:

I'd like to get your opinion / agreement on this before posting it to the talk page - I'm aiming for a neutral summary of the question at this point, not to push my opinion (though I will post an answer to my own question with my views in it!).

1716:, however there are many people who understand the proof in exactly this way. I was told that when explaining Godel's theorem, Solovay does this, and there are several articles which explain Godel's theorem in similar ways. I would 2322:

In your last post about my book being included in the quantum walk article, you said that "This doesn't mean that I'll object to its addition by another editor". My question is: what is the definition of a Knowledge (XXG) editor?

2617:

awards the person has received. So a Fields medalist is probably going to be a high-priority article, and someone who is well known in his or her area but not well-known among mathematicians in general would be low priority.

1493:

to possibly be correct" or "is obviously incorrect". The latter category of editors are mostly gone, so now the only objection is "This is not what they taught me in school". It is very important that this objection be opposed.

1482:

By shunting the self-reference and the arithmetization into the computer program, where it is obvious, instead of the logical deduction, where it is not, you simplify the presentation to the point where it is understandable by

585:

Not a subject I know much about but historically fast algorithms were not always desirable because they could be difficult to compute. Whether it is a "field" I an not sure but it is certainly an area of mathematical interest.

1056:

also gives this stronger version in his book. So, do you have access to the original paper I've added to that article? I probably do too, but I'm not very motivated to go the Physics library just for this (physics journal)...

2192:

Do not delete my book entry again, otherwise I shall be forced to make a serious and formal complain for such an outrageous behavior. You are not the owner of any Knowledge (XXG) page and have no right to censor information.

2040:

as Start class, not so much because I care much about that specific article (it is as you accurately assessed it of low priority) but in order to try to understand how my writing might be improved. Specifically, according to

1248:

The "properties" section is actually a list of properties of all decision trees, quantum, random and deterministic. Most of them are relationships between the three. So it's much better that they're all in the same article.

3564:

is missing a description and/or other details on its image description page. If possible, please add this information. This will help other editors make better use of the image, and it will be more informative to readers.

1586:

While one should not engage in debates on another user's talk page, I would like to quickly respond: "Kleene's T predicate" is the object that makes that the operation of a code "C" on input "I" after N steps an object of

3305:

If there are "pending" (unreviewed) edits for a page, they will be apparent in a page's history screen; you do not have to go looking for them. There is, however, a list of all articles with changes awaiting review at

1444:

Once you make these two simplifications, both of which are obvious today within computer science, Godel's theorem is trivial. In order to prove that a formal system S is incomplete, construct the code SPITE to do the

2363:. Even if you feel that you're not exactly violating COI, it would violate the spirit of that document. So what I meant is that if some other editor (besides you) feels that it should be added, I wont object to that. 3899: 3826: 3753: 1137:

that physicists agree on, let alone a computational model that exploits this theory. Consequently we have no idea how such a computer will behave. The only extensions of quantum computing I know are the following:

3252:

would look better if it said something like "for all". Both are correct though, and I wouldn't mind changing to the other definition if that seems clearer. Also, this way it looks similar to the definition of MA.

1552:

Regardless whether one is a newborn baby, one still has to prove that "SPITE does not halt" can actually be expressed as a formula in the language of arithmetic. This, in turn, requires developing something like

3668:. It has the authority to enact binding solutions for disputes between editors, primarily related to serious behavioural issues that the community has been unable to resolve. This includes the ability to impose 3613:. It has the authority to enact binding solutions for disputes between editors, primarily related to serious behavioural issues that the community has been unable to resolve. This includes the ability to impose 2416:

has 79 students. Only a few are listed on his page. All the listed ones have their own articles. In general, the doctoral students entry is for "Names of any notable doctoral students advised by the scientist."

2436:

Might we add Dan Gusfield, Ron Shamir, and Abhijit Sahay, even though they have no Knowledge (XXG) pages? They are notable doctoral students advised by the scientist. Can we add also add a link like this:

2620:

On the other hand, I try not to worry too much about making perfect assessments. The overall idea is that other people can correct the ratings, os that over time the settle into the correct values. — Carl

1608:

it is trivial, because primitive recursive arithmetic includes the elementary processor step of any computer as a primitive idea, and Godel's theorem works for any arithmetic that can describe a computer.

1175:(did not read it), but that publication often publishes dubious stuff, in part because editors don't always understand what they talk about. However, in Hardy's paper I found a link to a survey paper of 1405:

computed in a short time by pencil and paper. This fact is so obvious today, that it does not require detailed explanation. Turing and Intel tell us how to do this, not only in theory, but in practice.

3883:. It has the authority to impose binding solutions to disputes between editors, primarily for serious conduct disputes the community has been unable to resolve. This includes the authority to impose 3810:. It has the authority to impose binding solutions to disputes between editors, primarily for serious conduct disputes the community has been unable to resolve. This includes the authority to impose 3737:. It has the authority to impose binding solutions to disputes between editors, primarily for serious conduct disputes the community has been unable to resolve. This includes the authority to impose 2319:

I apologize for pestering you with one more question, but my lack of knowledge about Knowledge (XXG)'s nomenclature and my wish to make things fine with you and Verbal make me ask the following:

2114:, which aims to be accessible to those with a command of high school algebra, but which has been criticised for going into too much technical detail and mathematics for an introductory article. 1201:

as an open problem to come up with a way to characterize Quantum Gravity Polynomial Time (QGPT). Until this idea gets more coverage, I would hesitate to add it to a Knowledge (XXG) article. --

3587: 2732:

re: recent revert. I overlooked the definition of M(n) because it's buried in a specific table, yet used throughout the article. Maybe it should be moved out of the table in question?

83: 1300:"People always say, "the proof of the Incompleteness Theorem was a technical tour de force, it took 30 pages, it requires an elaborate construction involving prime numbers," etc." 1144:

What happens if we allow non-linear quantum mechanics? Answer: This model is too strong. It solves NP-complete problems in polytime. (I think shown by Abrams & Lloyd in 1998)

3039: 2871: 2042: 1530:, so that similar proofs can then be provided for injury-priority method, for turing degree theory, and other unfortunately obscure topics in computational mathematics. 219: 1395:

are both equally difficult to make precise. Both require an arbitrary encoding into integers of something or other. This is true--- but only if you are a newborn baby.

3318:

personal attacks, etc. If an edit is problematic, you can fix it by editing or undoing it, just like normal. You are permitted to mark your own changes as reviewed.

1361:

Please do not be intimidated by CBM. He opposes the text and wants to drive away supporters. With only two more voices on the opposite side, he would be outnumbered.

568:, which you proposed for deletion. I'm leaving this message here to notify you about it. If you still think the article should be deleted, please don't add the 3427: 1141:

What happens when we extend computation to topological quantum field theories? Answer: Equivalent to quantum computers. (Shown by Freedman, Kitaev, Wang in 2000)

2120:, a more descriptive article with less mathematical detail, but which has been criticised for going too much into the history and a lack of mathematical detail. 1783:

is novel, and very clear, but it does not extend the ideas in BKL in any significant way. This exposition is of the same type. These things must be protected.

2258:

I delivered my reply to your and Verbal's posts, about including my book on quantum walks in the survey section of Knowledge (XXG) article on quantum walks,

3398:

Ok, I got rid of the "we" in the lead. I did not remove any of your {{cn}} tags, only a {{whom}} tag, because the previous line proves the assertion. --

3941:. This is purely for routine maintenance and is not indicative of wrongdoing on your part. You may regain access at any time by simply requesting it at 3938: 3310:. Because there are so few pages in the trial so far, the latter list is almost always empty. The list of all pages in the pending review system is at 2163:

Yeah, this looks fine and summarizes the problem well. Perhaps it should be posted on Talk:QM and Talk:Intro, and have the discussion on Talk:Basics? --

263: 3432:

to see why this is (you may have to search for the title of the image to find its entry), if you are interested in it not being deleted. Thank you.

2709:

I've received an additional request for the WoRC bot task. I'd like to get some additional input before implementing. If you wish, please comment at

1038: 2522:

Yeah, that's fine. There should only be one intro. I'm not sure how you will appease the people who want math in the intro and those who don't. --

3464: 2262:. I do not mean to pressurize or be taken as pushy, I just want to make sure you know that my answer is already in the quantum walk talk page. 2213: 2359:

A Knowledge (XXG) editor is just anyone. You and me included. But as Verbal said, you should generally not add your own book back, because of

2104:

For a variety of reasons, there are currently two different introductory articles on Quantum Mechanics on Knowledge (XXG) (in addition to the

3558: 3545: 1604:

To see that it can be constructed in arithmetic with multiplication/addition existential/universal is a little bit of a headache. But within

508: 120:

or using four tildes (~~~~); this will automatically produce your username and the date. Finally, please do your best to always fill in the

3913: 3840: 3767: 3693: 3638: 259: 3569: 442: 2747:

Yes, feel free to do so. I just reverted because what you wrote was incorrect; I don't object to changing the placement of that text. --

2236: 2117: 851: 1172: 3368: 2816: 579: 486: 237: 2481:

subject classification puts complexity theory under two primary classifications: 03 (mathematical logic) and 68 (computer science).

2111: 794: 385: 1425:

sticking points for reading Godel's paper traditionally are understanding his computer, and understanding his self-reference trick.

314: 241: 1527: 1308:"(This is possible because the statement that a particular computer program halts is ultimately just a statement about integers.)" 2540:

Wow, that was quick! Hopefully we can reach a sensible compromise - but there's a reason I only said I'd propose the merger...

1020:, who apparently does research in this area. But he hasn't done much editing here lately, so it could take a while to hear back. 117: 1415:

a pre-existing computer, so he had to design his own. He did this in an arbitrary, unreadable, and completely uninteresting way.

420: 415: 364: 3909: 3836: 3763: 3689: 3634: 2596:

Sounds good, let us start the discussion on the talk page of the article, so that other interested editors may also join in. --

3892: 3819: 3746: 3423: 346: 178: 1605: 1924:

not follow Godel 1931, but Kleene's presentation some decades later. The proof of Rosser's theorem is usually just left out.

500: 351: 275: 1961:

undergraduate that failed to understand the proof of Godel's theorem. Usually they have taken a course on the subject, and

2668: 2478: 482: 376: 368: 292: 288: 250: 3216: 2185:

My name is Professor Salvador Venegas-Andraca and I am the author of the book "Quantum Walks for Computer Scientists".

1190: 1122: 1094: 1061: 1024: 991: 928: 681: 640: 87: 3934: 3680:

describes the Committee's roles and responsibilities in greater detail. If you wish to participate, you are welcome to

3625:

describes the Committee's roles and responsibilities in greater detail. If you wish to participate, you are welcome to

3294: 464: 424: 310: 271: 3937:

may be temporarily removed. If you do not resume editing within the next week, your username will be removed from the

3904: 3831: 3758: 3685: 3630: 2767:

Your comments are requested on a discussion about whether or not a particular page is a disambiguation page or a stub

2645: 2279: 1049: 2853: 437: 433: 297: 254: 1779:

However on Knowledge (XXG), clear pedagogy can be put in place. For example, the presentation of the BKL results on

2768: 2586: 2571: 2418: 2349: 2302: 2275: 2209: 923: 856: 749: 38: 1237:. I could have done this myself, but I don't want to deprive you of the glory of article creation :-) - Altenmann 1234: 393: 279: 246: 3419: 1073: 774: 389: 380: 172: 168: 2828: 2801: 2582: 2567: 2100:

Here's the text I promised to draft suggesting a discussion on the readership of the QM introductory articles.

2080: 2050: 1230: 963: 629: 3880: 3807: 3734: 495: 491: 446: 3583: 3579: 2240: 3472: 1187: 1119: 1091: 1058: 1021: 988: 759: 703: 678: 637: 3204: 2412:

Yes, they're special because they are notable (and have Knowledge (XXG) pages of their own). For instance,

2232: 2201: 2189:

was tremendoulsy annoying. Nobody owns Knowledge (XXG) and I have the right to advertise my publications.

1226: 318: 284: 111: 3307: 2812: 1149:

I don't know of any serious proposals for string theory computers, loop quantum gravity computers, etc. --

692: 670: 633: 3681: 3626: 2438: 2394: 472: 468: 359: 342: 305: 214: 3299: 2563: 2345: 2298: 2271: 2205: 1720:

publish this as a self-contained work (perhaps in an introduction to a longer work), because I would be

1554: 987:

Oddly enough, that one isn't even defined on the zoo, only FNL is. Maybe you know where to look for it?

879: 869: 3942: 355: 164: 3212: 3182:{\displaystyle \Pr \nolimits _{y\in \{0,1\}^{p(n)}}(\exists z\in \{0,1\}^{q(n)}\,M(x,y,z)=1)\leq 1/3.} 3014:{\displaystyle \Pr \nolimits _{y\in \{0,1\}^{p(n)}}(\forall z\in \{0,1\}^{q(n)}\,M(x,y,z)=0)\geq 2/3.} 2737: 1808:

If you still agree with CBM, then hopefully you will change your mind. If not, well, I am just sorry.

971: 952: 824: 3867: 3794: 3721: 3703: 3657: 3648: 3602: 3593: 478: 411: 3383:

and phrases that could be considered to be the opinion of the author: ( {{cn}} tags). Thanks. --

3311: 2718: 2653: 2445: 2402: 2076: 2046: 1238: 839: 819: 784: 3876: 3803: 3730: 3677: 3661: 3622: 3606: 182: 3530: 3498: 3451: 3208: 2037: 2030: 699: 540: 535:. Sorry about that, I must have been half asleep when I added the non-existent category back in. 1108: 504: 3438: 3388: 2827:

No problem. You didn't see it because I fixed the disambiguation page for Alternation to list

2807: 2671:

was what caused it – you can see why I was confused about what was wrong with my code. — Carl

2413: 2259: 2105: 2004: 1813: 1652: 1535: 910: 591: 121: 3888: 3815: 3742: 3673: 3665: 3618: 3610: 1523: 429: 301: 209: 3949: 3516: 3502: 3403: 3357: 3322:"reviewer" property, you may ask any administrator to remove it for you at any time. — Carl 3302:. The system is only being used for pages that would otherwise be protected from editing. 3293:

I have added the "reviewers" property to your user account. This property is related to the

3276: 3258: 2837: 2776: 2752: 2710: 2694: 2667:

The problem with ratemath and empty talk pages has been fixed, thanks to help from AzaToth.

2601: 2527: 2461: 2426: 2374: 2168: 2066: 1852: 1683: 1348: 1278: 1254: 1206: 1154: 1115: 1081: 1007: 933: 905: 861: 804: 789: 769: 718: 659: 133: 95: 47: 17: 3891:, editing restrictions, and other measures needed to maintain our editing environment. The 3884: 3818:, editing restrictions, and other measures needed to maintain our editing environment. The 3811: 3745:, editing restrictions, and other measures needed to maintain our editing environment. The 3738: 3676:, editing restrictions, and other measures needed to maintain our editing environment. The 3669: 3621:, editing restrictions, and other measures needed to maintain our editing environment. The 3614: 2360: 205: 187: 3575: 2545: 2512: 2397:? Karp's wiki page now lists just four of his students. Are these ones special somehow? 2151: 1780: 1337: 1134: 1053: 981: 967: 915: 897: 887: 733: 565: 103: 1133:

Yeah, I think it is extremely speculative at the moment. We don't even have a theory of

3476: 2714: 2649: 2441: 2398: 1176: 1017: 956: 892: 2648:

for how to use. If there are any questions or issues with the results, let me know. --

1325:

to Aaronson's proof, it is neither shorter nor easier than the standard proof. — Carl

1045: 609: 3526: 3494: 3460: 3341: 3329: 3271:

I decided to add both definitions, since there's no harm giving extra information. --

2678: 2628: 2491: 1564: 1332: 1229:, since there is enough text already, leaving a summary in the corresponding section 1168: 713:

Nah, it's fine. I'll trust your judgment. I didn't have any strong feelings on it. --

572: 558: 536: 1526:. I support this guideline. I hope that the short proof can be added to the text of 1293: 1164:

two different dimensions in his model. Anyway, I found the preprint of his paper on

3434: 3384: 2390: 2000: 1809: 1648: 1531: 809: 587: 3858: 3785: 3712: 124:

field. Below are some useful links to facilitate your involvement. Happy editing!

1179:

that discusses NP-completeness and physics in general, including quantum gravity

3956: 3917: 3844: 3771: 3697: 3642: 3534: 3520: 3512: 3480: 3445: 3407: 3399: 3392: 3361: 3353: 3346: 3280: 3272: 3262: 3254: 3220: 2841: 2833: 2821: 2794: 2780: 2772: 2756: 2748: 2741: 2722: 2698: 2690: 2683: 2657: 2633: 2605: 2597: 2590: 2575: 2549: 2531: 2523: 2516: 2496: 2465: 2457: 2449: 2430: 2422: 2406: 2378: 2370: 2353: 2327:

for me or another contributor to put my book back under the references section.

2306: 2244: 2217: 2172: 2164: 2155: 2084: 2070: 2062: 2054: 2008: 1856: 1848: 1817: 1687: 1679: 1656: 1569: 1539: 1352: 1344: 1282: 1274: 1258: 1250: 1242: 1210: 1202: 1195: 1183: 1158: 1150: 1127: 1099: 1085: 1077: 1066: 1029: 1011: 1003: 996: 975: 834: 764: 722: 714: 707: 698:

I unprodded Rohit Khare, who does seem sufficiently notable. Happy to discuss.

686: 663: 655: 645: 595: 544: 139: 125: 46:

If you wish to start a new discussion or revive an old one, please do so on the

3933:! This message is to inform you that due to editing inactivity, your access to 2733: 2541: 2508: 2147: 625: 3568:

If the information is not provided, the image may eventually be proposed for

3244:, the condition says that "there exists" something, I felt the condition for 2856:. I saw that the current condition for AM reads as follows (and is correct) 829: 1044:

There seem to be at least two variations of this, one as stated there, and

3337: 3325: 2674: 2624: 2487: 2128:

level(s) of readership should the introductory article(s) be targeted at?

1560: 1328: 754: 3895:

describes the Committee's roles and responsibilities in greater detail.

3822:

describes the Committee's roles and responsibilities in greater detail.

3749:

describes the Committee's roles and responsibilities in greater detail.

3572:, a situation which is not desirable, and which can easily be avoided. 2831:

instead of (algorithms), and created a redirect from (complexity) -: -->

2482: 1180: 1165: 736:

predicts that you will enjoy editing some of these articles. Have fun!

3664:

is the panel of editors responsible for conducting the Knowledge (XXG)

3609:

is the panel of editors responsible for conducting the Knowledge (XXG)

3525:

Thank you for the explanation and the edits. You've been very helpful.

3493:

don't know enough about quantum complexity to craft a sentence myself.

3488:

I think what this is saying is that given a quantum oracle (running in

944:

Your contributions make Knowledge (XXG) better -- thanks for helping.

874: 116: 2061:

have marked it as a B-class article. I've fixed the assessment now. --

2330:

I want to stick to the rules, so please give me some guidance here.

2292:

I have replied to your answer (3 November 2009). Please let me know.

962:

P.S. You received these suggestions because your name was listed on

110:

on your talk page and ask your question there. Please remember to

3192:

However, the second condition seems to go well together with the

2251:

Replies to your and Verbal's posts made on 1 and 2 November 2009

1273:

will be once upon a time on par with its relevance. Best wishes,

799: 578:

template back to the article. Instead, feel free to list it at

3898:

If you wish to participate in the 2018 election, please review

3825:

If you wish to participate in the 2017 election, please review

3752:

If you wish to participate in the 2016 election, please review

3489: 3468: 814: 25: 3228:

I felt the first one contrasts better with the condition for

329: 151: 77: 2507:

timeline / history articles if you still want to do this.)

1459:

Deduce all the theorems of S, looking for "R does not halt"

2566:

sounds good to me. I'll start working on it a bit. Best,

2456:

someone might revert your edit or question notability. --

1712:

I do happen to be the first person to state the proof in

779: 90:

to this 💕. If you decide that you need help, check out

3879:

is the panel of editors responsible for conducting the

3806:

is the panel of editors responsible for conducting the

3733:

is the panel of editors responsible for conducting the

1473:

Then the Godel sentence for S is "SPITE does not halt".

1292:

This is off topic so I thought I would put it here. In

966:. If this was in error, sorry about the confusion. -- 532: 2832:

Alternating TM, after you were done disambiguating. --

1016:

I decided to ask the editor that created the article,

3042: 2874: 2043:

Knowledge (XXG):Version 1.0 Editorial Team/Assessment

1957:

I get motivated to edit this article whenever I meet

1114:

Do you think this way speculative to even mention in

951:

on how to make SuggestBot better, please tell me on

3024:I wanted to note that it can be equally written as 2728:

Computational complexity of mathematical operations

2250: 2036:I'm trying to understand your recent assessment of 1317:this step by giving just a parenthetical comment. 3181: 3013: 2197:Professor Salvador Venegas-Andraca, DPhil (Oxon) 1002:Tried my sources. Can't seem to find it. Weird. -- 3656:You appear to be eligible to vote in the current 3601:You appear to be eligible to vote in the current 2639:Project Recognized Content & A-Class Articles 2229:I have replied in Quantum Walk discussion page. 2225:Reply to your criticism made on 1 November 2009 1384:Logical deductions are statements about integers 729:Articles you might like to edit, from SuggestBot 3471:are separated. This is an improvement over the 1182:. It looks like a good source for a section in 1048:that is stronger (roughly an equivalent of the 3925:Your access to AWB may be temporarily removed 3479:from EQP. The oracle needs to be quantum and 3414:File:Decision Problem.png listed for deletion 1522:This position is in a new proposed guideline 1513:clarity, not on how close it is to textbooks. 1052:for quantum computers). Needless to say that 8: 3112: 3099: 3067: 3054: 2944: 2931: 2899: 2886: 2502:Basic concepts of quantum mechanics (again!) 1265:Translation of the complexity theory article 2181:About Quantum Walks for Computer Scientists 2093:Discussion text on QM introductory articles 1754:surprising that it is not found everywhere. 1381:Computations are statements about integers 1370:CBM's position is that the two statements: 624:For the systematic effort of reducing the 3171: 3115: 3070: 3047: 3041: 3003: 2947: 2902: 2879: 2873: 1343:Oh, I see. Thanks for the explanation. -- 607: 3200:condition, as 2/3 and 1/3 add up to 1. 3130: 2962: 215:Where to ask questions or make comments 3574:If you have any questions, please see 44:Do not edit the contents of this page. 3559:File:Theoretical computer science.svg 3546:File:Theoretical computer science.svg 3418:A file that you uploaded or altered, 2790:Thanks for several corrections and a 580:Knowledge (XXG):Articles for deletion 7: 3868:2018 Arbitration Committee elections 3795:2017 Arbitration Committee elections 3722:2016 Arbitration Committee elections 2385:Doctoral students of Richard M. Karp 1456:Print its own code into a variable R 3881:Knowledge (XXG) arbitration process 3808:Knowledge (XXG) arbitration process 3735:Knowledge (XXG) arbitration process 2800:fix. I don't know why I didn't see 2118:Basic concepts of quantum mechanics 3852:ArbCom 2018 election voter message 3779:ArbCom 2017 election voter message 3424:Knowledge (XXG):Files for deletion 3369:Quantum phase estimation algorithm 3090: 2922: 188:Intuitive guide to Knowledge (XXG) 86:to Knowledge (XXG)! Thank you for 24: 3682:review the candidates' statements 3627:review the candidates' statements 3334:12:33, 18 June 2010 (UTC) — Carl 2393:list of graduate students at the 2112:Introduction to quantum mechanics 1724:. There is no original idea here. 795:Superconducting quantum computing 738: 3857: 3784: 3711: 3555:The media file you uploaded as: 2852:Hi Robin, thanks for the fix in 2689:Nice, thanks. Works fine now. -- 608: 115: 73: 29: 3902:and submit your choices on the 3829:and submit your choices on the 3289:I have marked you as a reviewer 2389:Why did you remove the link to 1528:Godel's incompleteness theorems 1462:if it finds this theorem, halt. 1039:Church–Turing–Deutsch principle 852:Gödel's incompleteness theorems 220:Request administrator attention 3688:. For the Election committee, 3658:Arbitration Committee election 3649:ArbCom elections are now open! 3633:. For the Election committee, 3603:Arbitration Committee election 3594:ArbCom elections are now open! 3408:04:22, 25 September 2010 (UTC) 3393:04:10, 25 September 2010 (UTC) 3162: 3153: 3135: 3125: 3119: 3087: 3080: 3074: 2994: 2985: 2967: 2957: 2951: 2919: 2912: 2906: 1606:primitive recursive arithmetic 1211:19:57, 13 September 2009 (UTC) 1196:19:45, 13 September 2009 (UTC) 1159:19:26, 13 September 2009 (UTC) 1128:19:14, 13 September 2009 (UTC) 1100:16:20, 13 September 2009 (UTC) 1086:13:51, 13 September 2009 (UTC) 1067:03:27, 13 September 2009 (UTC) 1030:23:33, 12 September 2009 (UTC) 1012:22:40, 12 September 2009 (UTC) 1: 3957:17:19, 28 December 2021 (UTC) 3918:18:42, 19 November 2018 (UTC) 3865:Hello, RobinK. Voting in the 3792:Hello, RobinK. Voting in the 3772:22:08, 21 November 2016 (UTC) 3719:Hello, RobinK. Voting in the 3698:14:09, 24 November 2015 (UTC) 3643:14:05, 24 November 2015 (UTC) 2781:20:06, 14 February 2010 (UTC) 2663:ratemath and empty talk pages 2606:20:07, 28 December 2009 (UTC) 2591:20:02, 28 December 2009 (UTC) 2576:19:24, 28 December 2009 (UTC) 2550:21:25, 30 November 2009 (UTC) 2532:21:17, 30 November 2009 (UTC) 2517:21:14, 30 November 2009 (UTC) 2497:15:51, 22 November 2009 (UTC) 2479:American mathematical society 2466:19:45, 17 November 2009 (UTC) 2450:17:56, 17 November 2009 (UTC) 2431:21:36, 16 November 2009 (UTC) 2407:20:17, 16 November 2009 (UTC) 2395:Mathematics Genealogy Project 1304:but then he goes on to say, 1288:On proofs of Goödel's theorem 997:23:40, 8 September 2009 (UTC) 264:Biographies of living persons 147: 3845:18:42, 3 December 2017 (UTC) 2757:23:34, 30 January 2010 (UTC) 2742:18:38, 30 January 2010 (UTC) 2723:22:22, 11 January 2010 (UTC) 2379:13:46, 5 November 2009 (UTC) 2354:05:23, 5 November 2009 (UTC) 2307:06:48, 4 November 2009 (UTC) 2280:23:13, 3 November 2009 (UTC) 2245:15:31, 1 November 2009 (UTC) 2218:07:08, 1 November 2009 (UTC) 2173:14:32, 24 October 2009 (UTC) 2156:11:43, 24 October 2009 (UTC) 2085:01:15, 22 October 2009 (UTC) 2071:00:58, 22 October 2009 (UTC) 2055:00:44, 22 October 2009 (UTC) 2009:21:07, 16 October 2009 (UTC) 1857:17:04, 16 October 2009 (UTC) 1818:01:28, 16 October 2009 (UTC) 1688:01:06, 16 October 2009 (UTC) 1657:00:27, 16 October 2009 (UTC) 1570:00:03, 16 October 2009 (UTC) 1540:23:36, 15 October 2009 (UTC) 1353:03:36, 15 October 2009 (UTC) 1338:03:07, 15 October 2009 (UTC) 1294:the lecture notes you linked 1283:21:13, 14 October 2009 (UTC) 929:Theoretical computer science 3756:and submit your choices on 3684:and submit your choices on 3629:and submit your choices on 3548:missing description details 3535:20:29, 19 August 2012 (UTC) 3521:15:07, 19 August 2012 (UTC) 3503:14:43, 19 August 2012 (UTC) 3446:04:10, 2 January 2012 (UTC) 3044: 2876: 2699:21:39, 9 January 2010 (UTC) 2684:19:54, 9 January 2010 (UTC) 2658:00:20, 8 January 2010 (UTC) 2634:02:51, 4 January 2010 (UTC) 1965:don't understand the proof. 1259:01:58, 7 October 2009 (UTC) 1243:23:29, 6 October 2009 (UTC) 1050:strong Church-Turing thesis 976:00:05, 28 August 2009 (UTC) 964:the SuggestBot request page 723:14:38, 26 August 2009 (UTC) 708:14:02, 26 August 2009 (UTC) 687:17:47, 25 August 2009 (UTC) 664:03:30, 23 August 2009 (UTC) 646:02:44, 23 August 2009 (UTC) 596:20:40, 20 August 2009 (UTC) 289:Policy for non-free content 260:What Knowledge (XXG) is not 3972: 3910:MediaWiki message delivery 3837:MediaWiki message delivery 3764:MediaWiki message delivery 3754:the candidates' statements 3690:MediaWiki message delivery 3635:MediaWiki message delivery 3588:09:16, 14 April 2013 (UTC) 2419:Template:Infobox_scientist 2029:Start-class assessment of 1225:Please split out the page 959:, SuggestBot's caretaker. 924:Clay Mathematics Institute 857:Orders of magnitude (time) 750:Introduction to Algorithms 741: 206:Frequently asked questions 114:on talk pages by clicking 3450: 3420:File:Decision Problem.png 3362:13:36, 18 June 2010 (UTC) 3347:13:00, 18 June 2010 (UTC) 3281:13:50, 18 June 2010 (UTC) 2842:13:54, 5 March 2010 (UTC) 2822:05:56, 5 March 2010 (UTC) 1109:Quantum gravity computers 845: 775:Persistent data structure 618:The Barnstar of Diligence 614: 3308:Special:OldReviewedPages 3263:13:17, 2 June 2010 (UTC) 3221:07:37, 2 June 2010 (UTC) 2829:Alternation (complexity) 2802:Alternation (complexity) 2705:Additional; WoRC Request 1231:Decision tree complexity 1221:Decision tree complexity 1167:. There's also an older 630:computational complexity 545:22:45, 9 July 2009 (UTC) 140:07:02, 6 July 2009 (UTC) 3473:Deutsch-Jozsa algorithm 1287: 1235:wikipedia:Summary style 760:Mathematical statistics 654:Thank you very much! -- 443:Pages needing attention 229:Policies and guidelines 3183: 3015: 2854:Arthur–Merlin_protocol 2562:Improving the article 953:SuggestBot's talk page 693:Separation of concerns 671:Separation of concerns 634:analysis of algorithms 3877:Arbitration Committee 3804:Arbitration Committee 3731:Arbitration Committee 3704:ArbCom Elections 2016 3662:Arbitration Committee 3607:Arbitration Committee 3422:, has been listed at 3184: 3016: 2763:Positive definiteness 2564:extremal graph theory 1714:exactly this language 1227:Quantum decision tree 1090:Thanks for the find. 880:Non-standard analysis 870:Tree (data structure) 238:Neutral point of view 183:upload and use images 42:of past discussions. 3040: 2872: 1555:Kleene's T predicate 825:Coherent information 315:Conflict of interest 242:No original research 3666:arbitration process 3611:arbitration process 3352:Alright, thanks. -- 3312:Special:StablePages 3298:system is given in 2583:ExtremalGraphTheory 2568:ExtremalGraphTheory 2288:Answer and question 840:Resource starvation 820:Set-theoretic limit 785:Warwick Arts Centre 628:in our articles on 554:I have removed the 421:The perfect article 365:No personal attacks 3893:arbitration policy 3820:arbitration policy 3747:arbitration policy 3706:: Voting now open! 3678:arbitration policy 3623:arbitration policy 3463:relative to which 3179: 3131: 3011: 2963: 2038:equitable coloring 2031:Equitable coloring 1296:, Aaronson says, 492:Join a WikiProject 416:Develop an article 412:Be bold in editing 88:your contributions 3580:Theo's Little Bot 3452:Simon's algorithm 3426:. Please see the 3345: 3333: 3224: 3207:comment added by 2820: 2682: 2632: 2495: 2414:Andrey Kolmogorov 2312:One more question 2235:comment added by 2221: 2204:comment added by 2108:article itself): 2106:Quantum mechanics 2075:Oh, ok. Thanks. — 1568: 1336: 1193: 1125: 1097: 1064: 1027: 994: 941: 940: 911:Keystroke logging 684: 651: 650: 643: 524: 523: 520: 519: 516: 515: 352:Assume good faith 326: 325: 276:Three-revert rule 146: 145: 138: 94:below, ask me on 67: 66: 54: 53: 48:current talk page 3963: 3955: 3954: 3952: 3861: 3788: 3715: 3444: 3441: 3335: 3323: 3223: 3201: 3188: 3186: 3185: 3180: 3175: 3129: 3128: 3086: 3085: 3084: 3083: 3020: 3018: 3017: 3012: 3007: 2961: 2960: 2918: 2917: 2916: 2915: 2810: 2799: 2793: 2672: 2622: 2485: 2346:Salvador.venegas 2299:Salvador.venegas 2272:Salvador.venegas 2247: 2220: 2206:Salvador.venegas 2198: 1558: 1326: 1191: 1123: 1116:quantum computer 1095: 1062: 1025: 992: 934:Mersenne twister 906:Gradient descent 862:Regular language 805:Hearts and Bones 790:Online algorithm 770:Nevanlinna Prize 739: 682: 641: 612: 605: 604: 577: 571: 563: 557: 501:Useful templates 403:Writing articles 377:Community portal 369:No legal threats 347:Resolve disputes 330: 293:Image use policy 251:Reliable sources 173:Getting mentored 169:Our five pillars 152: 148: 136: 132: 130: 119: 108: 102: 78: 74: 63: 56: 55: 33: 32: 26: 18:User talk:RobinK 3971: 3970: 3966: 3965: 3964: 3962: 3961: 3960: 3950: 3948: 3946: 3935:AutoWikiBrowser 3927: 3922: 3921: 3862: 3854: 3849: 3848: 3789: 3781: 3776: 3775: 3759:the voting page 3716: 3708: 3686:the voting page 3652: 3631:the voting page 3597: 3590: 3576:Help:Image page 3550: 3455: 3443: 3439: 3433: 3416: 3372: 3295:Pending changes 3291: 3202: 3111: 3066: 3043: 3038: 3037: 2943: 2898: 2875: 2870: 2869: 2850: 2797: 2791: 2788: 2765: 2730: 2711:this discussion 2707: 2665: 2641: 2614: 2560: 2504: 2474: 2387: 2314: 2290: 2253: 2230: 2227: 2199: 2183: 2095: 2034: 1781:BKL singularity 1290: 1267: 1223: 1135:quantum gravity 1112: 1054:Michael Nielsen 1042: 985: 982:FL (complexity) 955:. Thanks from 916:Packing problem 898:RE (complexity) 888:RP (complexity) 731: 696: 674: 603: 575: 569: 566:Fast algorithms 561: 555: 552: 550:Fast algorithms 529: 457: 425:Manual of style 404: 343:Build consensus 335: 311:Deletion policy 272:Manual of Style 230: 198: 157: 156:Getting started 142: 134: 126: 106: 100: 82:Hello, RobinK! 72: 59: 30: 22: 21: 20: 12: 11: 5: 3969: 3967: 3926: 3923: 3900:the candidates 3863: 3856: 3855: 3853: 3850: 3827:the candidates 3790: 3783: 3782: 3780: 3777: 3717: 3710: 3709: 3707: 3701: 3655: 3651: 3646: 3600: 3596: 3591: 3562: 3561: 3553:Dear uploader: 3551: 3549: 3543: 3542: 3541: 3540: 3539: 3538: 3537: 3486: 3485: 3454: 3449: 3437: 3415: 3412: 3411: 3410: 3371: 3366: 3365: 3364: 3290: 3287: 3286: 3285: 3284: 3283: 3266: 3265: 3190: 3189: 3178: 3174: 3170: 3167: 3164: 3161: 3158: 3155: 3152: 3149: 3146: 3143: 3140: 3137: 3134: 3127: 3124: 3121: 3118: 3114: 3110: 3107: 3104: 3101: 3098: 3095: 3092: 3089: 3082: 3079: 3076: 3073: 3069: 3065: 3062: 3059: 3056: 3053: 3050: 3046: 3022: 3021: 3010: 3006: 3002: 2999: 2996: 2993: 2990: 2987: 2984: 2981: 2978: 2975: 2972: 2969: 2966: 2959: 2956: 2953: 2950: 2946: 2942: 2939: 2936: 2933: 2930: 2927: 2924: 2921: 2914: 2911: 2908: 2905: 2901: 2897: 2894: 2891: 2888: 2885: 2882: 2878: 2849: 2846: 2845: 2844: 2787: 2784: 2764: 2761: 2760: 2759: 2729: 2726: 2706: 2703: 2702: 2701: 2664: 2661: 2640: 2637: 2613: 2612:Mathematicians 2610: 2609: 2608: 2559: 2558:collaboration? 2556: 2555: 2554: 2553: 2552: 2535: 2534: 2503: 2500: 2473: 2470: 2469: 2468: 2434: 2433: 2386: 2383: 2382: 2381: 2365: 2364: 2313: 2310: 2289: 2286: 2284: 2265:Best regards, 2252: 2249: 2226: 2223: 2196: 2182: 2179: 2178: 2177: 2176: 2175: 2140: 2139: 2130: 2129: 2124: 2123: 2122: 2121: 2115: 2094: 2091: 2090: 2089: 2088: 2087: 2077:David Eppstein 2047:David Eppstein 2033: 2027: 2026: 2025: 2024: 2023: 2022: 2021: 2020: 2019: 2018: 2017: 2016: 2015: 2014: 2013: 2012: 2011: 1981: 1980: 1979: 1978: 1977: 1976: 1975: 1974: 1973: 1972: 1971: 1970: 1969: 1968: 1967: 1966: 1940: 1939: 1938: 1937: 1936: 1935: 1934: 1933: 1932: 1931: 1930: 1929: 1928: 1927: 1926: 1925: 1906: 1905: 1904: 1903: 1902: 1901: 1900: 1899: 1898: 1897: 1896: 1895: 1894: 1893: 1892: 1891: 1872: 1871: 1870: 1869: 1868: 1867: 1866: 1865: 1864: 1863: 1862: 1861: 1860: 1859: 1831: 1830: 1829: 1828: 1827: 1826: 1825: 1824: 1823: 1822: 1821: 1820: 1795: 1794: 1793: 1792: 1791: 1790: 1789: 1788: 1787: 1786: 1785: 1784: 1766: 1765: 1764: 1763: 1762: 1761: 1760: 1759: 1758: 1757: 1756: 1755: 1749:Although this 1736: 1735: 1734: 1733: 1732: 1731: 1730: 1729: 1728: 1727: 1726: 1725: 1699: 1698: 1697: 1696: 1695: 1694: 1693: 1692: 1691: 1690: 1666: 1665: 1664: 1663: 1662: 1661: 1660: 1659: 1634: 1633: 1632: 1631: 1630: 1629: 1628: 1627: 1616: 1615: 1614: 1613: 1612: 1611: 1610: 1609: 1595: 1594: 1593: 1592: 1591: 1590: 1589: 1588: 1577: 1576: 1575: 1574: 1573: 1572: 1545: 1544: 1543: 1542: 1517: 1516: 1515: 1514: 1507: 1506: 1505: 1504: 1497: 1496: 1495: 1494: 1487: 1486: 1485: 1484: 1477: 1476: 1475: 1474: 1468: 1467: 1466: 1465: 1464: 1463: 1460: 1457: 1449: 1448: 1447: 1446: 1439: 1438: 1437: 1436: 1429: 1428: 1427: 1426: 1419: 1418: 1417: 1416: 1409: 1408: 1407: 1406: 1399: 1398: 1397: 1396: 1390: 1389: 1388: 1387: 1386: 1385: 1382: 1374: 1373: 1372: 1371: 1365: 1364: 1363: 1362: 1356: 1355: 1310: 1309: 1302: 1301: 1289: 1286: 1266: 1263: 1262: 1261: 1222: 1219: 1218: 1217: 1216: 1215: 1214: 1213: 1177:Scott Aaronson 1147: 1146: 1145: 1142: 1111: 1106: 1105: 1104: 1103: 1102: 1041: 1036: 1035: 1034: 1033: 1032: 1018:User:Creidieki 984: 979: 939: 938: 937: 936: 931: 926: 921: 918: 913: 908: 903: 900: 895: 893:Data structure 890: 885: 882: 877: 872: 867: 864: 859: 854: 849: 844: 843: 842: 837: 832: 827: 822: 817: 812: 807: 802: 797: 792: 787: 782: 777: 772: 767: 762: 757: 752: 747: 745: 730: 727: 726: 725: 695: 690: 673: 668: 667: 666: 649: 648: 621: 620: 615: 613: 602: 599: 551: 548: 528: 525: 522: 521: 518: 517: 514: 513: 512: 511: 498: 489: 475: 459: 458: 455: 452: 451: 450: 449: 440: 438:Disambiguation 427: 418: 406: 405: 402: 399: 398: 397: 396: 383: 373: 372: 371: 362: 349: 337: 336: 333: 327: 324: 323: 322: 321: 308: 298:External links 295: 282: 268: 267: 266: 257: 255:Citing sources 244: 232: 231: 228: 225: 224: 223: 222: 217: 212: 200: 199: 196: 193: 192: 191: 190: 185: 175: 159: 158: 155: 144: 143: 112:sign your name 81: 71: 68: 65: 64: 52: 51: 34: 23: 15: 14: 13: 10: 9: 6: 4: 3: 2: 3968: 3959: 3958: 3953: 3945:. Thank you! 3944: 3940: 3936: 3932: 3924: 3920: 3919: 3915: 3911: 3907: 3906: 3901: 3896: 3894: 3890: 3886: 3882: 3878: 3873: 3870: 3869: 3860: 3851: 3847: 3846: 3842: 3838: 3834: 3833: 3828: 3823: 3821: 3817: 3813: 3809: 3805: 3800: 3797: 3796: 3787: 3778: 3774: 3773: 3769: 3765: 3761: 3760: 3755: 3750: 3748: 3744: 3740: 3736: 3732: 3727: 3724: 3723: 3714: 3705: 3702: 3700: 3699: 3695: 3691: 3687: 3683: 3679: 3675: 3671: 3667: 3663: 3659: 3650: 3647: 3645: 3644: 3640: 3636: 3632: 3628: 3624: 3620: 3616: 3612: 3608: 3604: 3595: 3592: 3589: 3585: 3581: 3578:. Thank you. 3577: 3573: 3571: 3566: 3560: 3557: 3556: 3554: 3547: 3544: 3536: 3532: 3528: 3524: 3523: 3522: 3518: 3514: 3509: 3508: 3507: 3506: 3505: 3504: 3500: 3496: 3491: 3484: 3482: 3481:nondecohering 3478: 3474: 3470: 3466: 3462: 3461:random oracle 3457: 3456: 3453: 3448: 3447: 3442: 3436: 3431: 3430: 3425: 3421: 3413: 3409: 3405: 3401: 3397: 3396: 3395: 3394: 3390: 3386: 3382: 3378: 3370: 3367: 3363: 3359: 3355: 3351: 3350: 3349: 3348: 3343: 3339: 3331: 3327: 3319: 3315: 3313: 3309: 3303: 3301: 3296: 3288: 3282: 3278: 3274: 3270: 3269: 3268: 3267: 3264: 3260: 3256: 3251: 3247: 3243: 3239: 3235: 3231: 3227: 3226: 3225: 3222: 3218: 3214: 3210: 3206: 3199: 3195: 3176: 3172: 3168: 3165: 3159: 3156: 3150: 3147: 3144: 3141: 3138: 3132: 3122: 3116: 3108: 3105: 3102: 3096: 3093: 3077: 3071: 3063: 3060: 3057: 3051: 3048: 3035: 3031: 3027: 3026: 3025: 3008: 3004: 3000: 2997: 2991: 2988: 2982: 2979: 2976: 2973: 2970: 2964: 2954: 2948: 2940: 2937: 2934: 2928: 2925: 2909: 2903: 2895: 2892: 2889: 2883: 2880: 2867: 2863: 2859: 2858: 2857: 2855: 2847: 2843: 2839: 2835: 2830: 2826: 2825: 2824: 2823: 2818: 2814: 2809: 2805: 2803: 2796: 2785: 2783: 2782: 2778: 2774: 2770: 2762: 2758: 2754: 2750: 2746: 2745: 2744: 2743: 2739: 2735: 2727: 2725: 2724: 2720: 2716: 2712: 2704: 2700: 2696: 2692: 2688: 2687: 2686: 2685: 2680: 2676: 2670: 2662: 2660: 2659: 2655: 2651: 2647: 2638: 2636: 2635: 2630: 2626: 2618: 2611: 2607: 2603: 2599: 2595: 2594: 2593: 2592: 2588: 2584: 2578: 2577: 2573: 2569: 2565: 2557: 2551: 2547: 2543: 2539: 2538: 2537: 2536: 2533: 2529: 2525: 2521: 2520: 2519: 2518: 2514: 2510: 2501: 2499: 2498: 2493: 2489: 2483: 2480: 2471: 2467: 2463: 2459: 2454: 2453: 2452: 2451: 2447: 2443: 2440: 2432: 2428: 2424: 2420: 2415: 2411: 2410: 2409: 2408: 2404: 2400: 2396: 2392: 2384: 2380: 2376: 2372: 2367: 2366: 2362: 2358: 2357: 2356: 2355: 2351: 2347: 2342: 2339: 2335: 2331: 2328: 2324: 2320: 2317: 2311: 2309: 2308: 2304: 2300: 2296: 2293: 2287: 2285: 2282: 2281: 2277: 2273: 2269: 2266: 2263: 2261: 2256: 2248: 2246: 2242: 2238: 2237:189.144.33.80 2234: 2224: 2222: 2219: 2215: 2211: 2207: 2203: 2194: 2190: 2186: 2180: 2174: 2170: 2166: 2162: 2161: 2160: 2159: 2158: 2157: 2153: 2149: 2144: 2137: 2132: 2131: 2126: 2125: 2119: 2116: 2113: 2110: 2109: 2107: 2103: 2102: 2101: 2098: 2092: 2086: 2082: 2078: 2074: 2073: 2072: 2068: 2064: 2059: 2058: 2057: 2056: 2052: 2048: 2044: 2039: 2032: 2028: 2010: 2006: 2002: 1997: 1996: 1995: 1994: 1993: 1992: 1991: 1990: 1989: 1988: 1987: 1986: 1985: 1984: 1983: 1982: 1964: 1960: 1956: 1955: 1954: 1953: 1952: 1951: 1950: 1949: 1948: 1947: 1946: 1945: 1944: 1943: 1942: 1941: 1922: 1921: 1920: 1919: 1918: 1917: 1916: 1915: 1914: 1913: 1912: 1911: 1910: 1909: 1908: 1907: 1888: 1887: 1886: 1885: 1884: 1883: 1882: 1881: 1880: 1879: 1878: 1877: 1876: 1875: 1874: 1873: 1858: 1854: 1850: 1845: 1844: 1843: 1842: 1841: 1840: 1839: 1838: 1837: 1836: 1835: 1834: 1833: 1832: 1819: 1815: 1811: 1807: 1806: 1805: 1804: 1803: 1802: 1801: 1800: 1799: 1798: 1797: 1796: 1782: 1778: 1777: 1776: 1775: 1774: 1773: 1772: 1771: 1770: 1769: 1768: 1767: 1752: 1748: 1747: 1746: 1745: 1744: 1743: 1742: 1741: 1740: 1739: 1738: 1737: 1723: 1719: 1715: 1711: 1710: 1709: 1708: 1707: 1706: 1705: 1704: 1703: 1702: 1701: 1700: 1689: 1685: 1681: 1676: 1675: 1674: 1673: 1672: 1671: 1670: 1669: 1668: 1667: 1658: 1654: 1650: 1646: 1642: 1641: 1640: 1639: 1638: 1637: 1636: 1635: 1624: 1623: 1622: 1621: 1620: 1619: 1618: 1617: 1607: 1603: 1602: 1601: 1600: 1599: 1598: 1597: 1596: 1585: 1584: 1583: 1582: 1581: 1580: 1579: 1578: 1571: 1566: 1562: 1556: 1551: 1550: 1549: 1548: 1547: 1546: 1541: 1537: 1533: 1529: 1525: 1521: 1520: 1519: 1518: 1511: 1510: 1509: 1508: 1501: 1500: 1499: 1498: 1491: 1490: 1489: 1488: 1481: 1480: 1479: 1478: 1472: 1471: 1470: 1469: 1461: 1458: 1455: 1454: 1453: 1452: 1451: 1450: 1443: 1442: 1441: 1440: 1433: 1432: 1431: 1430: 1423: 1422: 1421: 1420: 1413: 1412: 1411: 1410: 1403: 1402: 1401: 1400: 1394: 1393: 1392: 1391: 1383: 1380: 1379: 1378: 1377: 1376: 1375: 1369: 1368: 1367: 1366: 1360: 1359: 1358: 1357: 1354: 1350: 1346: 1342: 1341: 1340: 1339: 1334: 1330: 1322: 1318: 1314: 1307: 1306: 1305: 1299: 1298: 1297: 1295: 1285: 1284: 1280: 1276: 1270: 1269:Dear RobinK, 1264: 1260: 1256: 1252: 1247: 1246: 1245: 1244: 1241: 1236: 1232: 1228: 1220: 1212: 1208: 1204: 1199: 1198: 1197: 1194: 1189: 1185: 1181: 1178: 1174: 1170: 1169:New Scientist 1166: 1162: 1161: 1160: 1156: 1152: 1148: 1143: 1140: 1139: 1136: 1132: 1131: 1130: 1129: 1126: 1121: 1117: 1110: 1107: 1101: 1098: 1093: 1089: 1088: 1087: 1083: 1079: 1075: 1071: 1070: 1069: 1068: 1065: 1060: 1055: 1051: 1047: 1040: 1037: 1031: 1028: 1023: 1019: 1015: 1014: 1013: 1009: 1005: 1001: 1000: 999: 998: 995: 990: 983: 980: 978: 977: 973: 969: 965: 960: 958: 954: 950: 945: 935: 932: 930: 927: 925: 922: 919: 917: 914: 912: 909: 907: 904: 901: 899: 896: 894: 891: 889: 886: 883: 881: 878: 876: 873: 871: 868: 865: 863: 860: 858: 855: 853: 850: 847: 846: 841: 838: 836: 833: 831: 828: 826: 823: 821: 818: 816: 813: 811: 808: 806: 803: 801: 798: 796: 793: 791: 788: 786: 783: 781: 778: 776: 773: 771: 768: 766: 763: 761: 758: 756: 753: 751: 748: 746: 743: 742: 740: 737: 735: 728: 724: 720: 716: 712: 711: 710: 709: 705: 701: 700:MarkBernstein 694: 691: 689: 688: 685: 680: 672: 669: 665: 661: 657: 653: 652: 647: 644: 639: 635: 631: 627: 623: 622: 619: 616: 611: 606: 601:Encouragement 600: 598: 597: 593: 589: 583: 582:. Thanks! 581: 574: 567: 560: 549: 547: 546: 542: 538: 534: 527:Cluster state 526: 510: 506: 502: 499: 497: 493: 490: 488: 484: 480: 476: 474: 470: 466: 463: 462: 461: 460: 456:Miscellaneous 454: 453: 448: 444: 441: 439: 435: 431: 428: 426: 422: 419: 417: 413: 410: 409: 408: 407: 401: 400: 395: 394:Mailing lists 391: 387: 384: 382: 378: 375: 374: 370: 366: 363: 361: 357: 353: 350: 348: 344: 341: 340: 339: 338: 334:The community 332: 331: 328: 320: 316: 312: 309: 307: 303: 299: 296: 294: 290: 286: 283: 281: 280:Sock puppetry 277: 273: 270: 269: 265: 261: 258: 256: 252: 248: 247:Verifiability 245: 243: 239: 236: 235: 234: 233: 227: 226: 221: 218: 216: 213: 211: 207: 204: 203: 202: 201: 195: 194: 189: 186: 184: 180: 176: 174: 170: 166: 163: 162: 161: 160: 154: 153: 150: 149: 141: 137: 131: 129: 123: 118: 113: 109: 105: 97: 93: 89: 85: 80: 79: 76: 75: 69: 62: 58: 57: 49: 45: 41: 40: 35: 28: 27: 19: 3930: 3928: 3903: 3897: 3874: 3866: 3864: 3830: 3824: 3801: 3793: 3791: 3757: 3751: 3728: 3720: 3718: 3653: 3598: 3567: 3563: 3552: 3487: 3458: 3428: 3417: 3380: 3376: 3373: 3320: 3316: 3304: 3292: 3249: 3245: 3241: 3237: 3236:, since for 3233: 3229: 3197: 3193: 3191: 3033: 3029: 3023: 2865: 2861: 2851: 2808:CRGreathouse 2806: 2789: 2786:DSPACE, etc. 2766: 2731: 2708: 2666: 2642: 2619: 2615: 2579: 2561: 2505: 2475: 2435: 2388: 2343: 2340: 2336: 2332: 2329: 2325: 2321: 2318: 2315: 2297: 2294: 2291: 2283: 2270: 2267: 2264: 2257: 2254: 2228: 2195: 2191: 2187: 2184: 2145: 2141: 2135: 2099: 2096: 2035: 1962: 1958: 1750: 1721: 1717: 1713: 1644: 1643:But this is 1323: 1319: 1315: 1311: 1303: 1291: 1271: 1268: 1224: 1113: 1072:Do you mean 1043: 986: 961: 948: 947:If you have 946: 942: 810:Charge qubit 732: 697: 675: 617: 584: 553: 530: 509:User scripts 390:IRC channels 381:Village pump 197:Getting help 127: 122:edit summary 99: 96:my talk page 92:Getting Help 91: 60: 43: 37: 3951:MusikBot II 3943:WP:PERM/AWB 3905:voting page 3832:voting page 3475:separating 3203:—Preceding 2316:Hi RobinK, 2255:Hi RobinK, 2231:—Preceding 2200:—Preceding 1959:yet another 1587:arithmetic. 1184:NP-complete 884:Add Sources 835:Kyoto Prize 765:Computation 496:Translation 447:Peer review 179:edit a page 98:, or place 36:This is an 3889:topic bans 3816:topic bans 3743:topic bans 3674:topic bans 3619:topic bans 3459:We have a 3429:discussion 3300:this image 3032:is not in 2864:is not in 2097:Hi Robin, 1722:embarassed 1445:following: 968:SuggestBot 734:SuggestBot 626:randomness 477:Clean up: 473:Talk pages 469:User pages 434:Categories 319:Notability 285:Copyrights 165:A tutorial 3939:CheckPage 3885:site bans 3812:site bans 3739:site bans 3670:site bans 3615:site bans 2715:JLaTondre 2650:JLaTondre 2442:Quantling 2439:Full List 2399:Quantling 2268:Salvador 2146:Thanks! 957:ForteTuba 830:Disperser 677:article.) 564:tag from 487:Vandalism 465:User name 360:Etiquette 306:Vandalism 61:Archive 1 3570:deletion 3527:Skippydo 3495:Skippydo 3217:contribs 3205:unsigned 2646:template 2341:Cheers, 2233:unsigned 2214:contribs 2202:unsigned 1171:article 1074:this one 949:feedback 755:Bhaskara 537:Euryalus 386:Signpost 356:Civility 177:How to: 3435:The Haz 3385:Kudpung 3248:not in 3036:, then 2868:, then 2484:— Carl 2001:Likebox 1890:answer. 1810:Likebox 1649:Likebox 1532:Likebox 1524:WP:ESCA 1483:anyone. 875:1 E-2 s 848:Cleanup 588:Thincat 531:You're 479:General 84:Welcome 70:Welcome 39:archive 3931:RobinK 3929:Hello 3660:. The 3605:. The 3584:error? 3209:Sg313d 3196:is in 2773:Neelix 2391:Karp's 2361:WP:COI 1275:Hermel 1233:, per 920:Expand 902:Wikify 128:Verbal 104:helpme 3513:Robin 3400:Robin 3354:Robin 3273:Robin 3255:Robin 2848:AM,MA 2834:Robin 2749:Robin 2691:Robin 2598:Robin 2542:Djr32 2524:Robin 2509:Djr32 2458:Robin 2423:Robin 2371:Robin 2165:Robin 2148:Djr32 2063:Robin 1963:still 1849:Robin 1751:exact 1718:never 1680:Robin 1345:Robin 1251:Robin 1239:: --> 1203:Robin 1151:Robin 1078:Robin 1004:Robin 866:Merge 744:Stubs 715:Robin 656:Robin 533:right 505:Tools 430:Stubs 16:< 3914:talk 3875:The 3841:talk 3802:The 3768:talk 3729:The 3694:talk 3639:talk 3531:talk 3517:talk 3499:talk 3467:and 3440:talk 3404:talk 3389:talk 3379:and 3358:talk 3342:talk 3330:talk 3277:talk 3259:talk 3213:talk 2838:talk 2804:... 2777:talk 2769:here 2753:talk 2738:talk 2719:talk 2713:. -- 2695:talk 2679:talk 2669:This 2654:talk 2629:talk 2602:talk 2587:talk 2572:talk 2546:talk 2528:talk 2513:talk 2492:talk 2472:PPAD 2462:talk 2446:talk 2427:talk 2421:) -- 2403:talk 2375:talk 2350:talk 2303:talk 2276:talk 2260:here 2241:talk 2210:talk 2169:talk 2152:talk 2081:talk 2067:talk 2051:talk 2005:talk 1853:talk 1814:talk 1684:talk 1653:talk 1565:talk 1536:talk 1349:talk 1333:talk 1279:talk 1255:talk 1207:talk 1192:ping 1188:Pcap 1186:... 1173:here 1155:talk 1124:ping 1120:Pcap 1096:ping 1092:Pcap 1082:talk 1076:? -- 1063:ping 1059:Pcap 1026:ping 1022:Pcap 1008:talk 993:ping 989:Pcap 972:talk 800:Edge 719:talk 704:talk 683:ping 679:Pcap 660:talk 642:ping 638:Pcap 632:and 592:talk 573:prod 559:prod 541:talk 483:Spam 302:Spam 210:Tips 135:chat 3654:Hi, 3599:Hi, 3490:BQP 3469:BQP 3465:BPP 3377:you 3338:CBM 3326:CBM 3314:. 3240:in 3232:in 3028:if 2860:if 2734:-kj 2675:CBM 2625:CBM 2488:CBM 2344:S. 2295:S. 2136:TBD 1561:CBM 1329:CBM 1046:one 815:XTR 3947:— 3916:) 3908:. 3887:, 3843:) 3835:. 3814:, 3770:) 3762:. 3741:, 3696:) 3672:, 3641:) 3617:, 3586:) 3533:) 3519:) 3501:) 3406:) 3391:) 3381:we 3360:) 3340:· 3328:· 3279:) 3261:) 3253:-- 3219:) 3215:• 3177:3. 3166:≤ 3097:∈ 3091:∃ 3052:∈ 3045:Pr 3009:3. 2998:≥ 2929:∈ 2923:∀ 2884:∈ 2877:Pr 2840:) 2815:| 2798:}} 2795:dn 2792:{{ 2779:) 2771:. 2755:) 2740:) 2721:) 2697:) 2677:· 2656:) 2627:· 2604:) 2589:) 2574:) 2548:) 2530:) 2515:) 2490:· 2464:) 2448:) 2429:) 2405:) 2377:) 2369:-- 2352:) 2305:) 2278:) 2243:) 2216:) 2212:• 2171:) 2154:) 2083:) 2069:) 2053:) 2007:) 1855:) 1847:-- 1816:) 1686:) 1655:) 1645:it 1563:· 1538:) 1351:) 1331:· 1281:) 1257:) 1249:-- 1209:) 1157:) 1084:) 1010:) 974:) 721:) 706:) 662:) 636:. 594:) 576:}} 570:{{ 562:}} 556:{{ 543:) 507:• 503:• 494:• 485:• 481:• 471:• 467:• 445:• 436:• 432:• 423:• 414:• 392:• 388:• 379:• 367:• 358:• 354:• 345:• 317:• 313:• 304:• 300:• 291:• 287:• 278:• 274:• 262:• 253:• 249:• 240:• 208:• 181:• 171:• 167:• 107:}} 101:{{ 3912:( 3839:( 3766:( 3692:( 3637:( 3582:( 3529:( 3515:( 3497:( 3483:. 3477:P 3402:( 3387:( 3356:( 3344:) 3336:( 3332:) 3324:( 3275:( 3257:( 3250:L 3246:x 3242:L 3238:x 3234:L 3230:x 3211:( 3198:L 3194:x 3173:/ 3169:1 3163:) 3160:1 3157:= 3154:) 3151:z 3148:, 3145:y 3142:, 3139:x 3136:( 3133:M 3126:) 3123:n 3120:( 3117:q 3113:} 3109:1 3106:, 3103:0 3100:{ 3094:z 3088:( 3081:) 3078:n 3075:( 3072:p 3068:} 3064:1 3061:, 3058:0 3055:{ 3049:y 3034:L 3030:x 3005:/ 3001:2 2995:) 2992:0 2989:= 2986:) 2983:z 2980:, 2977:y 2974:, 2971:x 2968:( 2965:M 2958:) 2955:n 2952:( 2949:q 2945:} 2941:1 2938:, 2935:0 2932:{ 2926:z 2920:( 2913:) 2910:n 2907:( 2904:p 2900:} 2896:1 2893:, 2890:0 2887:{ 2881:y 2866:L 2862:x 2836:( 2819:) 2817:c 2813:t 2811:( 2775:( 2751:( 2736:( 2717:( 2693:( 2681:) 2673:( 2652:( 2631:) 2623:( 2600:( 2585:( 2570:( 2544:( 2526:( 2511:( 2494:) 2486:( 2460:( 2444:( 2425:( 2417:( 2401:( 2373:( 2348:( 2301:( 2274:( 2239:( 2208:( 2167:( 2150:( 2138:. 2079:( 2065:( 2049:( 2003:( 1851:( 1812:( 1682:( 1651:( 1567:) 1559:( 1534:( 1347:( 1335:) 1327:( 1277:( 1253:( 1240:t 1205:( 1153:( 1080:( 1006:( 970:( 780:P 717:( 702:( 658:( 590:( 539:( 50:.

Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.

Index