Knowledge talk:WikiProject Mathematics/Archive/2021/Jun

1940:"Recursive language" appears more frequent than "decidable language" in recent publications although both are in similarly-wide use. However, a lot of the Google Scholar hits for "recursive language" appear to be in the context of the development of natural languages, as a way of distinguishing basic utterances from things with a nontrivial syntax, far from the technical meaning used here. "Decidable language" would be more unambiguous. I don't think this has been a very active area of computer science research for the last 50 years; it's more just a basic concept that is occasionally used as a tool in other research topics. So for instance in relativized computational complexity theory (itself not exactly a hot area) one still sees "recursive oracle" rather than "decidable oracle". — 2234:. While an FA must meet each criterion, in my experience the most important issue for these old FAs is referencing. Our expectations on inline citations have changed a lot over the past twenty years, so making sure that there aren't vast deserts of uncited text is really important. Fixing up any prose issues is also helpful, as is making sure that the article is still a comprehensive overview of the subject. 3) The year provided is the year of the most recent FAC or FAR. Older articles often require more work, but this is of course only a generalization. This list contains only articles that have not been reviewed in more than ten years. 4) If this sort of work interests you, please come help out at 2410:

labor of love: almost all FA articles are created/shepherded by one person who is passionate about that particular topic. If/when that passionate person retires, so does the passion. It's hard (impossible?) for the disinterested bystander to make the kind of edits needed to make an FA article: one is not eating, sleeping and drinking the topic. (Literally. Don't know about you, but when I am creating WP articles I care about, I think about it while I walk the dog, while I fall asleep, when I wake up. All that thinking provides the needed corrections, amplifications and expanded sections. Without this effort, the coverage & content would be just .. meh.)

1625:

the original meaning of “recursive” and induction as understood by Dedekind, Peano, Hilbert, Skolem, Godel ... and by most modern computer scientists, mathematicians, and physical scientists. Presently, if functions are defined, or sets are enumerated, or relative computability is defined using Turing machines, register machines, or variants of these ... then the name “computable” rather than “recursive” will be attached to the result, ... Thus, the terms “recursive” and “computable” have reacquired their traditional and original meanings, and those understood by most outsiders.

2729:

understanding of the Euler–Mascheroni constant is that its primary use is as the constant error term in the approximation of the harmonic series by the logarithm (or, I suppose, vice versa, but that's the usual direction of approximation for me), and that it belongs more to the analysis or maybe analytic number theory sections than in a section on applied mathematics and a sentence on differential equations. But maybe there's an application of this constant to differential equations with which I'm unfamiliar and which the "Appearances" section of

2182:. I prefer "computable" and "computably enumerable" because they are more readily understood and far less readily misunderstood by strangers to that area of study. One could also make an argument for saying "More than one editor think that" instead of "More than one editor thinks that", on the grounds that "more than one" is plural, but that is not the way the English language conventionally works. The extent linguistic to which convention should govern this present issue is a question about which I am not prepared to argue. 1571:. In any case, Knowledge is not aimed for specialists of computability theory, and must not be confusing for non-specialists. The systematic change that you propose would be highly confusing for people who use results of computability theory without being specialists of it (for example, the existence of a recursively enumerable set that is not recursive is widely used in algebra and number theory for proving that some properties are not decidable; an important example is Fröhlich–Shepherson theorem of non-computability of 1725:. I just polled some theoretical-CS faculty colleagues on this; they were not aware of a shift in terminology, and tend to use older textbooks (Sipser and/or Lewis and Papadimitriou) where recent trends might not be apparent. But we all agreed that "computable" is an acceptable and familiar alternative to "recursive", and probably preferable because of the potential of confusing "recursive" with the programming-language concept of recursion. — 40: 1548:"Recursively enumerable" or "r.e." is an outdated term, and "computably enumerable" or "c.e." is used instead in modern literature on computability theory (last 20-30 years). You are correct that the term "recursively enumerable" is unambiguous, and established in the sense that older literature uses it. To clarify, I would keep "r.e." as a synonym in the lead, but change all subsequent occurrences and move the article to 1787:

because I thought of it as "all computable functions are recursive". It was explained to me that that wasn't the point; that Soare simply wanted to repurpose "computable" as the precise technical term for what had been called "recursive", so that now Church's thesis (or if you prefer the Church–Turing thesis, but I did go to UCLA after all) would be something like "all informally computable functions are computable".

2382:

readers to them, to show the world that mathematics is an important part of Knowledge, and to bring interest to mathematics more generally, and groupings like FA, GA, and DYK can provide an opportunity to do that, and (2) the pressure to meet the arbitrary milestone can help us improve the articles, especially when they are deficient in obvious ways. —

3393: 3614:. Articles are typically reviewed for two weeks. If substantial concerns are not addressed during the review period, the article will be moved to the Featured Article Removal Candidates list for a further period, where editors may declare "Keep" or "Delist" the article's featured status. The instructions for the review process are 2687:. Articles are typically reviewed for two weeks. If substantial concerns are not addressed during the review period, the article will be moved to the Featured Article Removal Candidates list for a further period, where editors may declare "Keep" or "Delist" the article's featured status. The instructions for the review process are 3198:) = 0", depending on context.) "An arbitrary" may suffer from the same problem, again depending on context. "Each", "every", and "for all" do not have this problem. They have different grammatical behaviors, so which one to use is largely a question of writing style (does the sentence work better with a singular or a plural?). 2919:

I've been editing Knowledge for 7 years (and this section appears to have existed intact for over a year, by the way) and this is the most ridiculous thing I've ever seen. A reproduction of a mathematical proof is forbidden?! What? Then any mathematical proof or definition, once it's found, can never

2409:

easier to take a low-importance article, and make it FA, than a top-importance article, because the top-importance articles have to say more stuff in exactly the right way, whereas lacunae in low-importance articles are easily overlooked (and, frankly, don't matter). The other reality is that WP is a

2381:

While having the articles be as good as they can be is obviously more important than making them meet arbitrary internal milestones, here are two reasons why we might care about this anyway: (1) we want our best mathematics articles to be highlighted as part of the best content on Knowledge, to bring

2351:

I hope this list is useful to you all. Getting these FAs taken care of outside the formal process is good for everyone: it reduces the URFA backlog, it gives you all advance notice of potential issues, and it provides an incentive to improve these important articles. Do let me know if I can be of any

1789:

If I could wave a magic wand and undo the change, would I? Probably not. I've gotten used to it by now. I'm still not a big fan of the "political" subtext of Cooper's paper, linked above, but the terminology does have some practical advantages, in that it decouples the concept from self-reference,

1624:

Researchers in the subject have recently changed the the name of the subject from “Recursion Theory” to “Computability Theory” in order to make clear this distinction . Thus, the term “recursive” no longer carries the additional meaning of “computable” or “decidable,” as it once did. This reinforces

1283:

Essentially all papers and books written recently about recursion/computability theory use the term "computable" in favour of "recursive". Sadly, ngrams aren't supporting this, but I think this is for the reasons I outline below - the term "recursion" is used in a much broader sense. However, if you

1650:

Things started to change in earnest around 1995–96. These changes were rooted in two seemingly unrelated developments, one philosophical and political in content, and the other technical. The first involved a deliberate attempt to reinstate Turing’s terminology in keeping with the subject’s origins

3360:

English-speaking mathematicians use "any" too much. They forget that in some contexts, it means "some" rather than "every". "If every A is B then...." is clear. "If any A is B then..." might mean "If there is any A that is B, then..." or it might mean "If it is the case that any A, no matter which

2424:

Perhaps the reason why the percentage of editors is biased is that it was evaluated as FA when there were few editors on wikipedia. Articles marked FA basically do not need to be edited, and it seems unlikely that an inexperienced editor like me would edit an article marked FA. Creating an article

2728:

There's a sentence in the article that's confusing me, and I think here may be a better place than the FAR to get an informed opinion: In the applied mathematics section, it states "He also facilitated the use of differential equations, in particular introducing the Euler–Mascheroni constant". My

1743:

Yes, (older) people who know some computability, but are not specialists, may not be aware of this change. The TCSists I know like the term "decidable", e.g. for type-checking, and to be clear, I would keep such terms as synonyms in the articles. However, I agree that "computable" is clearer than

3040:

To be clear, the discussion is invalid in Redirects for discussion (Complex variables (disambiguation)). Apparently, on this page or on the complex variable talk page, the discussion has to be restarted from the beginning. I am sorry to have those who participated in the discussion express their

2425:

from scratch is difficult, so it seems like we start by editing (on wikipedia) the article in the start-class or C-class article. (stub-class editing is difficult.) I'm not confident in editing articles in B-class and above. Perhaps I wouldn't edit FA-class articles without FAR. (My two cents).--

1786:

I was actually not a fan of Soare's change at the time he initially proposed it, in the mid-nineties, for a couple reasons. One, I'm generally skeptical of self-conscious programs of language reform. Beyond that, I was concerned that it seemed to be trying to make Church's thesis true by fiat,

1288:, you will notice they all use "computable" instead of "recursive". Further evidence is Soare's 2016 book "Turing Computability", which is essentially a second edition of his 1987 book "Recursively Enumerable Sets and Degrees", with most instances of the word "recursive" replaced by "computable". 3450:

for continuous numbering and cross-referencing of list items. The request itself concerns example numbering in linguistics articles, but I suspect this functionality would be useful for theorem numbering in mathematics articles as well. If you would support this idea or if you would like to add

1758:

They were not all older, but "know (and teach) some computability, but are not specialists" is accurate. On the other hand, I think that because the rudiments of this material are commonly taught in undergraduate computer science programs, making the main articles on this material accessible to

1656:

I disagree that this change would be confusing - in fact, I think it would clarify things, as "computable", rather than "recursive", is now the popular and accepted term for the concept, both for specialists in computability, and people who know not the subject. The one exception might be older

1954:

I have not responded before because I had nothing to add to my comment. Presently, I acknowledge that sources have been provided that support the terminology shift. Also, it is better that terminology gives hints to the meaning of the used terms and phrases. This is the positive aspect of this

3702:. Hartogs shows Oka's lemma in the case of two variables, which is Hartogs's problem, and Levi's problem is the opposite. And the problem of Levi problem has various meanings now. (e.g. Stein manifold, Complex projective space, Stein space, etc.) Oka's proof is an unramified Riemann domain ( 1635:

After the articles and on the history and scientific reasons for why we should use “computable” and not “recursive” to mean “calculable,” many authors changed terminology to have “recursive” mean only inductive and they introduced new terms such as “computably enumerable (c.e.)” to replace

1657:

mathematicians with weak connections to computability theory, who may not be aware of the terminology change (e.g. algebraists). However, your result could equally well be stated "there is a computably enumerable set which is not computable", and I think the meaning of this is clearer. --

1522:, which is one of several models of computation for computable functions. "Recursive function" was also presented as an other name for "computable function" before saying that "mu-recursive functions" are a model of computation for computable functions. I have just fixed this. The term 2201:. I applaud the change. Every time I would stumble over "recursively enumerable" I would have to stop in my tracks and look up the definition and make sure I wasn't cross-eyed while re-reading it for the 13th time. Whereas the meaning of "computably enumerable" is obvious. So Yay! 3090:, and Articles for Creation is not the way to propose changes to an existing article. I don't know whether it will be obvious to a mathematician what has changed, let alone whether the changes should be made. I just thought I would call this to your-all's attention. 2264:: Notice has not yet been given for these articles, so they aren't urgent priorities. Just take a look and see if there are any obvious issues with them that need work. If you feel confident in your understanding of the featured article criteria, feel free to go to 3113:. I'm wondering whether to make it "any" or "arbitrary". "any" seems to have a similar meaning to "for all" and has been used for one variable (also, "every" was often used) , but several complex variable textbooks and papers often use "arbitrary", so only use for 1566:

You must provide sources attesting that "recursively enumerable" is an outdated term. A source using "computably enumerable" witout discussing the use of these terms is not such a requested source. Without such sources, your assertion that the term is outdated is

2131:. If this change is done then in the disambiguation parentheses (and other contexts where it can reduce potential for confusion) the replacement should be of "recursion theory" by "computability theory", not simply "computability" as was done in some cases. So 1763:, and that the nomenclature they learn it by is at least as relevant as current specialist practice in making this decision. Fortunately, this doesn't lead to much conflict: from that point of view, moving away from "recursive" also comes out as a good idea. — 2229:

somebody starts the formal delisting process. I've done that below; here are a few thoughts: 1) These articles are not all the same. Some may have no issues at all, while others may be practically unsalvageable. 2) You can read the featured article criteria

2065:

merely because we're mostly writing in English rather than German these days; this comes across as the same sort of suggestion. I don't know of any sources that call these ones anything other than R and RE. That's how they're listed in the Complexity Zoo

3204:

has much more serious grammatical/language issues than this choice. At some point hopefully it will be copy-edited by a fluent English speaker, who will have the opportunity to patch this up. Personally, I would write "For one complex variable, every

2404:

Where should one expend effort? One might argue that the energy would be better spent on the most-frequently viewed articles. Another possibility is that all top-priority articles should be made FA. This is balanced by several realities: it is a

1682:. It is my understanding that this is the usage in the field these days. While D.Lazard is completely correct that it is not Knowledge's role to change usage, that is not what has happened here — usage has changed in the wild. Unfortunately 2893:

Yes, can please someone else have a look? I'm pretty sure reproduction of a mathematical proof (of all things!) published somewhere is not copyright violation, otherwise no mathematical proof will be legally reproducible after it's found?!

3781:

Addendum 2; For drafts, it seems that in some countries the symbol representing the floor function is called the Gaussian symbol, and if English-speaking mathematicians do not use this term often or use it in a different sense, send it to

2963:

of an argument is one thing, but carrying over the prose and the notation practically verbatim is another. And the fact that it hung around for a year is immaterial; a problem is still a problem even if people were late to notice it.

1636:“recursively enumerable.” This helped lead to an increased awareness of the relationship of Turing computability to other areas. There sprang up organizations like Computability in Europe (CiE) which developed these relationships. 1955:

terminilogy shift. So, I do not oppose anymore to the four remaining proposed moves, if a note is added to the moved articles for explaining the terminology shift (a single sentence with a reference to Soares may suffices).

2781:

I agree — I revised the sentence about the constant and moved it to the analysis section. Also, I'd sort of like to eliminate the "Applied mathematics" section altogether, and redistribute its subjects into other sections.

3146:, but I follow the paper because for several complex variables their nature depends on how the space is taken anyway. Perhaps this is also useful when editing other articles, and I don't understand this well. thanks!-- 2244:: These are the most urgent priorities. Someone has made a note on the article's talk page that the article may not meet the featured article criteria. Such articles are in danger of being imminently taken to FAR. 3161:

I suggest avoiding "any": it can be used in some situations for both existential and universal quantifiers in normal speech, so is confusing about which formal statement it corresponds to. (For example, "if any

2853:

is a blatant copyright violation: it is a verbatim copy (letter for letter, down to idiosyncracies in the notation) of almost the complete text (only omitting the initial sentence) of the paper Bogdan Veklych,

3607: 1298:. In general, the usual (informal) meaning of "recursive" doesn't coincide with the computability-theoretic meaning. Indeed, this was the primary motivation behind the change described in the previous item. 3311:, but there was no template for WikiProject Mathematics. Replacing "arbitrary" seems difficult about Levi's problem statement seems difficult. For example; each complex manifold chosen for arbitrary? -- 1804:

or whatever name we picked, and that article should not be so tightly tied to μ-recursion. I don't think that's a very good plan, but it's the only reasonable alternative to the proposed changeover. --

3451:

anything to the feature request, you can leave a comment at the Phabricator page. Alternately, if anybody has any handy tricks or secret workarounds using currently existing features, please do share!

2656:

be merge? The alternating series are mixed, but I think there is no problem because it converges absolutely. How about the title, such as ′′Infinite sum of multiplicative inverse of Power of two′′?--

63: 3562:

I don't know why you list Nim as unrated. An anonymous editor just rated it as C-class, two weeks ago. I agree (it's too detailed for start-class and has too much unsourced content to be B-class). —

1704:, which should be slightly rewritten to clarify that it is about the precise concept with many different provably equivalent definitions, and not about informal computability. See my remarks in 3763:

Addendum 1; Perhaps the decision to create a redirect depends on how English-speaking mathematicians often call Levi's problem. From the same point of view, we can decide whether to send the

2225:. So I figured it might be useful to put together a list of old FAs within this project's scope that could be in danger of potentially losing their star, in the hope of getting them fixed up 2973: 4028: 2680: 1914:(who still hasn't responded after I provided sources witnessing the change in terminology). I would appreciate input from other editors on whether they support or oppose such changes. 2722: 2021:

We shouldn't be making up new names for complexity classes — they're a piece of standardized notation, not merely an abbreviation for an English phrase. You wouldn't propose changing

1194: 1190: 1186: 1182: 1178: 1174: 1170: 1166: 1162: 1151: 1147: 1143: 1139: 1135: 1131: 1127: 1123: 1119: 1115: 1111: 1107: 1092: 1088: 1084: 1080: 1076: 1072: 1068: 1064: 1060: 1056: 1052: 1048: 1037: 1033: 1029: 1025: 1021: 1017: 1009: 1005: 1001: 997: 993: 982: 978: 974: 970: 966: 962: 958: 954: 950: 946: 942: 938: 927: 923: 919: 915: 911: 907: 903: 899: 895: 891: 887: 883: 872: 868: 864: 860: 856: 852: 848: 844: 840: 836: 832: 828: 817: 813: 809: 805: 801: 797: 793: 789: 785: 781: 777: 773: 762: 758: 754: 750: 746: 742: 738: 734: 730: 726: 722: 718: 707: 703: 699: 695: 691: 687: 683: 679: 675: 671: 667: 663: 652: 648: 644: 640: 636: 632: 628: 624: 620: 616: 612: 608: 597: 593: 589: 585: 581: 577: 573: 569: 565: 561: 557: 553: 542: 538: 534: 530: 526: 522: 518: 514: 510: 506: 502: 498: 487: 483: 479: 475: 471: 467: 463: 459: 455: 451: 447: 443: 432: 428: 424: 420: 416: 412: 408: 404: 400: 396: 392: 388: 377: 373: 369: 365: 361: 357: 353: 349: 345: 341: 337: 333: 322: 318: 314: 310: 306: 302: 298: 294: 290: 286: 282: 278: 267: 263: 259: 255: 251: 247: 243: 239: 235: 231: 227: 223: 212: 208: 204: 200: 196: 192: 188: 184: 180: 176: 172: 168: 157: 153: 149: 145: 141: 137: 133: 129: 125: 121: 117: 113: 3269: 3234: 1822:

it seems there was consensus around some things, such as changing disambiguating parentheses in article titles from "(recursion theory)" to "(computability)". Hence, I've now moved

3729: 3140: 1500:

The two first proposed changes are almost already done, and completing them does not require any discussion here; the third one is against Knowledge general policy. In details,

3307:

Thank you for the advice and reply. I edited it a little and replaced it with "every". I agree that the Manual of Style needs advice. Also, apparently there is a page of the

2810: 1157: 1102: 1043: 988: 933: 878: 823: 768: 713: 658: 603: 548: 493: 438: 383: 328: 273: 218: 163: 108: 25: 2063: 2041: 3023: 2483:

Nice work! However, tonnes of readers are still flocking to this page for information and basing our reputation on it. So, the more comprehensive the better in my books!--

56: 3939:

if you want to reach consensus. 2. Have you considered instead editing Knowledge in whatever your native language is? I suspect you could be a valuable editor there. --

3809: 3791: 3776: 3758: 3740: 102: 98: 94: 90: 3240:

of some function. For several complex variables, this is not the case, and so ...." Or, if I wanted to really drive home the point: "For one complex variable, every

3577: 3543: 4046: 21: 3275:

of some function. For several complex variables, this is not the case: there exist domains that are not the domain of holomorphy of any function, and so ...." -

49: 2986:

Hi, mathematicians! There's a discussion going on about what constitutes a "routine calculation", and I think it would benefit from your input. Please see

1692:

at the moment is largely about one particular model of computation, which could be called μ-recursion. That content should appear under some such title as

2094:. I agree with Trovatore that, for better or worse, the terminology used by practicing logicians has changed, so it makes sense for Knowledge to follow. 2649: 3329:

Existential quantifiers can also sometimes be replaced by verbs of possession: "every domain has a function for which it is the domain of holomorphy". —

1651:

in real world questions — ‘computable’ in place of ‘recursive’ etc. — a project outlined in Robert Soare’s 1996 paper on ‘Computability and recursion’.

1615:" was the original proposal to those in the field to change terminology from "recursive" to "computable". He wrote an revised version in 1999, called " 3022:

Retarget to Complex analysis, and with hatnote to Function of several complex variables. Also delete "Complex variables (disambiguation)". Also see

2920:

be presented again, because it occurs in the original article, and so reproducing it again would be violating the copyright? Is this the logic?!

3611: 2684: 2653: 17: 3405: 3290: 3201: 3110: 1206: 1202: 1198: 1526:

is well established and unambiguous. It is not the role of Knowledge to change an established term, so I strongly oppose to any change of

2645: 2537: 3507: 2987: 3669: 2935: 2909: 2873: 2411: 2368: 2296: 2202: 2140: 3615: 2798: 2688: 2248: 2166: 1978: 1930: 1749: 1662: 1557: 1512:. So, I agree with changing the disambiguating parentheses in article titles from "(recursion theory)" to "(computability theory)". 1484: 1360: 2469:

I have "resolved" this by reclassifying the article as C-class. (The prose is pretty good; the sourcing is very weak, though.) --

1377:

To clarify and reiterate, you're not proposing article moves for those three examples, right? So not replacing the disambiguation

3929: 3911: 3001: 1995:

Looking for redirects "r.e." and/or "c.e." (both are important, since they are hard to find by string search), I found the link

1705: 2756:? in Euler's times, complex analysis was not well developed but Euler certainly had the foresight for complex analysis. ) and 3241: 3206: 1642: 3994:

under the name Virginia-American. The computer died, I lost my password, etc., and finally now I'm back under a new handle.

2730: 2113:

has been removing vital-article templates from the talk pages of these renamed articles. I suspect that that is a mistake.

1452: 3679:; discuss there if interested. (I'm posting a notice here since it's about mathematics but is not in the article alerts.) 3376:

Thank you for the advice. Even if the paper uses "any", I will now try to choose clearer words when quoting to wikipedia--

2308: 1921:, as this concept seems more in the realm of theoretical CS, where they may use different terminology. Then again, maybe 3638: 2757: 2696: 2357: 2352:

assistance: while my mathematical expertise is lacking, I'm glad to answer any questions about the FAR process. Cheers!

2326: 2162: 1974: 1926: 1892: 1851: 1839: 1831: 1745: 1658: 1553: 1480: 1372: 1356: 1315: 4011: 3962: 3948: 3688: 3658: 3627: 3589: 3571: 3556: 3460: 3431: 3417: 3385: 3370: 3352: 3338: 3320: 3302: 3284: 3155: 3099: 3069: 3050: 3035: 3005: 2954: 2939: 2913: 2887: 2836: 2791: 2776: 2742: 2707: 2665: 2628: 2568: 2520: 2506: 2492: 2478: 2463: 2434: 2419: 2391: 2376: 2361: 2210: 2191: 2170: 2148: 2122: 2103: 2078: 2016: 1982: 1964: 1949: 1934: 1813: 1772: 1753: 1734: 1717: 1666: 1584: 1561: 1539: 1488: 1396: 1364: 3991: 2817: 1568: 1349: 1238: 3821:

Noguchi, Junjiro (2018). "A Brief Chronicle of the Levi (Hartogs' Inverse) Problem, Coherence and an Open Problem".

2132: 3413: 2832: 2012: 1883: 1823: 1801: 1697: 1689: 1519: 1467: 1311: 1303: 3935:

1. This is what article talk-pages are for: you made a bad edit, it was reverted, you should now begin discussion

3095: 3083: 3076: 1843: 1835: 1471: 1331: 1319: 2268:

and follow the instructions to either give notice, mark the article as satisfactory, or provide other comments.

2221:

I know a number of you have done great work in saving old math-related featured articles from being delisted at

1217: 3567: 3334: 2738: 2624: 2502: 2387: 2074: 1945: 1768: 1730: 1572: 3086:, was submitted for review. However, it seems to be a modified version of the article that we already have, 1412:

I am proposing a terminology change, which might affect the titles of some articles. However, this change is

3603: 3366: 2608: 2353: 2254: 2187: 2158: 2136: 2099: 1827: 1327: 3684: 3500: 3246: 3211: 3057: 2931: 2905: 2867: 2787: 2601: 2415: 2372: 2206: 2144: 1896: 1855: 1847: 1385:, but rather just a terminology change solely within the prose of articles within computability theory? — 1518:

is a disambiguation page linking to several meanings; the one that is related to computability theory is

4007: 3983: 3958: 3925: 3907: 3836: 3805: 3796:

I noticed that the draft:Gaussian symbol was translated from Chinese wikipedia, so check Babel and ping

3787: 3772: 3764: 3754: 3736: 3456: 3427: 3409: 3381: 3348: 3316: 3151: 3046: 3031: 2969: 2850: 2843: 2806: 2772: 2749: 2718: 2661: 2451: 2430: 2332: 2008: 1887: 1608:

naturally, it's hard to find sources attesting to this, but here is what I could find in a quick search:

1549: 2927: 2901: 2863: 3858: 1902:

My reasons are as stated above. My interpretation of the above discussion is that I have support from

3705: 3514: 3272: 3237: 3116: 3091: 2997: 2923: 2897: 2525: 2497:

I agree, that looks like a C-class article to me. Also, this just goes to show, views ≠ importance. —

2000: 1509: 1430: 1419: 1254: 3884: 3881: 3987: 3976: 3944: 3676: 3563: 3330: 3280: 3087: 2950: 2753: 2734: 2620: 2498: 2474: 2383: 2265: 2238:. We have an enormous backlog of old featured articles on all subjects that are in need of review. 2235: 2118: 2070: 1941: 1907: 1809: 1797: 1764: 1760: 1726: 1713: 1701: 1456: 1382: 1345: 2161:

has exactly the same meaning, is just as unambiguous, plus saves seven characters in the title. --

1973:

Great! I will absolutely reference the old terminology and explain the shift in those articles. --

3822: 3749:

because there is an aspect that Oka called it. Would you like to redirect to Oka's lemma lemma?--

3362: 3065: 2828: 2278: 2183: 2095: 2046: 2024: 1960: 1922: 1918: 1869: 1693: 1580: 1535: 1514: 1436: 1378: 1323: 1223: 1686:

seems to have stopped editing; he would be the one I would naturally go to to find good sources.

1616: 3892: 3343:

Thank you for the advice. It's an interesting. By repeating the paraphrase, it becomes clear.--

1612: 3680: 3651: 3585: 3552: 3479: 3012: 2783: 2713:

This has received some attention since the FAR was announced, but it could benefit from more.

2564: 2516: 2488: 2459: 1865: 1307: 4003: 3954: 3921: 3903: 3870: 3801: 3783: 3768: 3750: 3732: 3493: 3452: 3423: 3377: 3344: 3312: 3298: 3147: 3042: 3027: 3016: 2965: 2802: 2768: 2714: 2692: 2657: 2587: 2426: 2344: 1426: 1221: 1219: 39: 1630:

Soare, in his book "Turing Computability", also discusses the change briefly (sec. 17.7.2):

1279:, and the most common name throughout the 20th century. However, in the last 20 years (?), 3849: 3623: 2991: 2884: 2877: 2763: 2619:

I also re-rated Kelly criterion as C-class, and the three supposed stubs as start-class. —

2573: 2531: 2320: 2231: 1996: 3361:

one, is B, then..." In the first case, it means "some"; in the second, it means "every".

3953:

Thank you for your advice. I apologize for my lack of ability, but I will try my best.--

2876:), who hasn’t got the slightest clue about copyright law and scientific publishing (see 1257:, I propose changing the terminology from "recursive X" to "computable X". For example: 3940: 3665: 3521: 3401: 3276: 2946: 2676: 2470: 2314: 2114: 2004: 1903: 1878: 1805: 1709: 3997:

Could someone who knows the conventions please add categories, ratings, and so forth?

3142:, "arbitrary". Because it feels like arbitrary is randomly selected. There is also an 4040: 3918:

If P is the set of all prime numbers and the prime number set (set P) is finite set …

3899: 3061: 3024:

Knowledge:Redirects for discussion/Log/2021 June 5#Complex variables (disambiguation)

2824: 2823:

Found in new article queue. Please review and expand at your leisure. Many thanks. --

2222: 1956: 1911: 1874: 1603: 1576: 1531: 1276: 3797: 3746: 3643: 3581: 3548: 3486: 2580: 2560: 2512: 2484: 2455: 2290: 2284: 1407: 1387: 3694:

I would like to create a Hartogs' Inverse Problem as a redirect of Levi's problem

3294: 2859: 2748:

I agree with you, but I'm also interested in classifying the section names into

2701: 2594: 2338: 2110: 3408:, which seems the most appropriate place to me. Please improve if necessary. - 1796:

decide to go with the older terminology, then most of the content currently at

3619: 2881: 2862:. (It’s a short paper.) I tried to remove it, but I am being reverted by user 2272: 2067: 3875: 3535: 3308: 1295: 3731:), so this term may also accurately refer to Oka's achievements. thanks!-- 3898:

I would like to some advice about the edit warring. I tried to avoid the

2302: 1683: 3982:

A number of years ago I edited several number theory articles including

3466:

The 10 most-viewed, worst-quality articles according to this Wikiproject

2880:), but is all the more aggressive for it. Can someone else have a look?— 1352:

as they are, as those are still the popular names for those concepts.

1302:

There are plenty of pages which use the outdated terminology, such as

3528: 2959:

Yeah, that's way too close a copy to be permissible. Reproducing the

2858:, The American Mathematical Monthly 126 (2019), no. 10, p. 928, doi: 1790:

whereas on its face "recursive" looks like it's about self-reference.

2760:(I don't know if it's a transcendental number…), also interested in 3827: 2511:

Fyi here are the 3 most-viewed stub articles in your Wikiproject:--

1267:"recursively enumerable", "r.e." ⇒ "computably enumerable", "c.e." 2367:

Why does it matter if an article is a "featured article" or not?

1285: 1281:

there has been a sea change towards the terminology "computable".

4023:

tags on this page, but the references will not show without a

3693: 3472: 1224: 33: 3447: 1344:

instance of the word "recursive". For instance, I would keep

1249:

Proposal: change terminology from "recursive" to "computable"

3610:. Please join the discussion on whether this article meets 2683:. Please join the discussion on whether this article meets 1294:, as it can refer to many other things, particularly the 3639:

Talk:Trapezium and Trapezoid#Requested move 21 June 2021

1503: 2856:

A Minimalist Proof of the Law of Quadratic Reciprocity

1253:

In many articles concerning the mathematical field of

3708: 3249: 3214: 3119: 2049: 2027: 3174:) = 0" as a stand-alone phrase could mean "if every 1443:, informal notion of "recursive", therefore this is 1423:. Regarding the three examples I gave at the start: 1286:

recently published computability articles on zbMATH

3723: 3263: 3228: 3134: 2069:, without any mention of synonyms, for instance. — 2057: 2035: 2007:; more "R"s might be found in similar classes. - 1641:Cooper and Odifreddi also mention the change in " 3578:Knowledge:WikiProject Mathematics/Popular pages 3544:Knowledge:WikiProject Mathematics/Popular pages 1861:I'd still like to move the following articles: 1648: 1633: 1622: 3859:"Domaines finis sans point critique intérieur" 3060:. Interested editors can participate there. -- 1447:of what I'm proposing. Hence no changes here. 2447:Most viewed start article in this Wikiproject 1275:"Recursion theory" was the original name for 1261:"recursion theory" ⇒ "computability (theory)" 1232:This page has archives. Sections older than 57: 8: 3109:For example, I would like some advice about 2849:The proof of quadratic reciprocity given in 1264:"recursive function" ⇒ "computable function" 1846:, but the latter is already a redirect to 1433:, so there would be no title changes here. 64: 50: 3902:argument when it was Re(s) = 1. thanks!-- 3874: 3826: 3715: 3711: 3710: 3707: 3257: 3256: 3248: 3222: 3221: 3213: 3126: 3122: 3121: 3118: 3111:Function of several complex variables#top 2051: 2050: 2048: 2029: 2028: 2026: 1759:students at that level is important, per 3406:Mathematics#Writing_style_in_mathematics 1617:The History and Concept of Computability 1575:over some explicit computable fields). 88: 3845: 3834: 3699: 3580:- it was listed as 'Unknown' there. -- 3143: 1917:For now, I don't think we should move 1271:I have two reasons for this proposal: 18:Knowledge talk:WikiProject Mathematics 4047:WikiProject Mathematics archives/2021 3291:Knowledge:Manual of Style/Mathematics 3264:{\displaystyle D\subset \mathbb {C} } 3229:{\displaystyle D\subset \mathbb {C} } 3202:Function of several complex variables 2559:And some of the most-viewed starts:-- 2217:Old featured articles – you can help! 1455:, I would be proposing to move it to 1453:recursive function (recursion theory) 7: 3293:does not give advice on this issue. 4015: 3508:Dependent and independent variables 2988:Knowledge talk:No original research 2799:Featured Article Removal Candidates 2577:for the budding gamblers out there? 1439:is a disambiguation page about the 1340:I am not proposing this change for 3916:I forgot to write a set. perhaps, 3670:Indecomposability (disambiguation) 2797:The article has been moved to the 2297:Introduction to general relativity 1744:"recursive" to almost everyone. -- 45:WikiProject Mathematics archives ( 32: 3637:Members of this project may find 1292:The word "recursive" is ambiguous 1236:may be automatically archived by 3724:{\displaystyle \mathbb {C} ^{n}} 3391: 3135:{\displaystyle \mathbb {C} ^{n}} 1619:", in which he remarks (sec. 7): 1459:. However, this is not the case. 1296:more general notion of recursion 38: 3863:Japanese Journal of Mathematics 3598:FAR for Polar coordinate system 3400:I boldly added a note based on 1706:talk:general recursive function 1688:As a side note, the content of 3448:feature request on Phabricator 3442:Feature request on Phabricator 2604:51,260 1,708 Start Low --: --> 2597:53,839 1,794 Start Mid --: --> 2590:55,424 1,847 Start Low --: --> 2583:62,452 2,081 Start Low --: --> 2576:76,759 2,558 Start Mid --: --> 2133:Forcing (computability theory) 1910:, with some disagreement from 1: 3975:I have rewritten the article 3056:I've summarised the issue at 2860:10.1080/00029890.2019.1655331 2654:1/4 + 1/16 + 1/64 + 1/256 + ⋯ 2309:Edward Wright (mathematician) 1850:. In any case, it looks like 3608:featured article review here 3200:The current lead section of 2758:transcendental number theory 2681:featured article review here 2327:Numerical weather prediction 2058:{\displaystyle \mathbb {I} } 2036:{\displaystyle \mathbb {Z} } 1893:Recursively inseparable sets 1852:Reduction (recursion theory) 1840:Reduction (recursion theory) 1832:Index set (recursion theory) 1451:there was an article called 1316:index set (recursion theory) 3992:Floor and ceiling functions 3700:problème inverse de Hartogs 3186:) = 0" or "there exists an 3105:every vs. any vs. arbitrary 2851:Quadratic reciprocity#Proof 2818:John Rognes (mathematician) 2157:Not sure I agree - I think 1613:Computability and Recursion 4063: 3633:RM Trapezium and Trapezoid 3482:99,039 3,194 Start Unknown 3475:13,375 431 Unknown Unknown 3144:arbitrary complex manifold 2650:1/2 − 1/4 + 1/8 − 1/16 + ⋯ 2646:1/2 + 1/4 + 1/8 + 1/16 + ⋯ 2584:for the superstitious lot? 2538:1/2 + 1/4 + 1/8 + 1/16 + ⋯ 2123:18:48, 30 April 2021 (UTC) 2104:03:44, 28 April 2021 (UTC) 2079:07:38, 27 April 2021 (UTC) 2017:07:25, 27 April 2021 (UTC) 1999:. Should it be renamed to 1983:22:38, 26 April 2021 (UTC) 1965:09:45, 26 April 2021 (UTC) 1950:01:39, 26 April 2021 (UTC) 1935:01:23, 26 April 2021 (UTC) 1884:Recursively enumerable set 1824:Forcing (recursion theory) 1814:23:02, 21 April 2021 (UTC) 1802:general recursive function 1773:01:00, 22 April 2021 (UTC) 1754:20:54, 21 April 2021 (UTC) 1735:19:43, 21 April 2021 (UTC) 1718:18:31, 21 April 2021 (UTC) 1698:general recursive function 1690:general recursive function 1667:20:51, 21 April 2021 (UTC) 1643:Incomputability and Nature 1585:10:42, 21 April 2021 (UTC) 1562:09:45, 21 April 2021 (UTC) 1540:09:21, 21 April 2021 (UTC) 1520:General recursive function 1489:08:18, 21 April 2021 (UTC) 1468:recursively enumerable set 1397:07:30, 21 April 2021 (UTC) 1365:05:30, 21 April 2021 (UTC) 1350:Kleene's recursion theorem 1318:. I would rename these to 1312:forcing (recursion theory) 1304:recursively enumerable set 4012:21:33, 30 June 2021 (UTC) 3963:13:33, 29 June 2021 (UTC) 3949:11:59, 29 June 2021 (UTC) 3930:11:09, 29 June 2021 (UTC) 3912:10:39, 29 June 2021 (UTC) 3810:02:03, 24 June 2021 (UTC) 3792:07:34, 19 June 2021 (UTC) 3777:03:16, 19 June 2021 (UTC) 3759:02:30, 19 June 2021 (UTC) 3741:16:37, 16 June 2021 (UTC) 3689:07:56, 22 June 2021 (UTC) 3659:16:05, 21 June 2021 (UTC) 3628:14:39, 19 June 2021 (UTC) 3612:featured article criteria 3590:08:19, 19 June 2021 (UTC) 3572:07:29, 19 June 2021 (UTC) 3557:07:16, 19 June 2021 (UTC) 3461:15:19, 16 June 2021 (UTC) 3432:03:10, 16 June 2021 (UTC) 3418:15:13, 15 June 2021 (UTC) 3404:'s example at the end of 3386:03:28, 15 June 2021 (UTC) 3100:20:55, 13 June 2021 (UTC) 3084:Draft:Dirichlet character 3077:Draft:Dirichlet character 3070:18:08, 13 June 2021 (UTC) 3006:17:08, 12 June 2021 (UTC) 2731:Euler–Mascheroni constant 2685:featured article criteria 1925:is a more common name? -- 1844:Reduction (computability) 1836:Index set (computability) 1508:is already a redirect to 1472:computably enumerable set 1332:index set (computability) 1320:computably enumerable set 3937:on the article talk-page 3698:Oka calls Levi problem. 3371:04:38, 6 June 2021 (UTC) 3353:11:32, 1 June 2021 (UTC) 3339:19:49, 31 May 2021 (UTC) 3321:15:32, 31 May 2021 (UTC) 3303:12:56, 30 May 2021 (UTC) 3285:11:36, 30 May 2021 (UTC) 3156:06:01, 30 May 2021 (UTC) 3051:01:14, 9 June 2021 (UTC) 3036:04:00, 8 June 2021 (UTC) 2974:16:10, 9 June 2021 (UTC) 2955:13:56, 9 June 2021 (UTC) 2940:11:50, 9 June 2021 (UTC) 2914:11:41, 9 June 2021 (UTC) 2888:07:38, 9 June 2021 (UTC) 2837:06:52, 7 June 2021 (UTC) 2811:17:45, 6 June 2021 (UTC) 2792:04:03, 27 May 2021 (UTC) 2777:14:28, 26 May 2021 (UTC) 2743:07:35, 25 May 2021 (UTC) 2723:20:36, 24 May 2021 (UTC) 2666:12:04, 2 June 2021 (UTC) 2629:16:43, 31 May 2021 (UTC) 2569:19:34, 30 May 2021 (UTC) 2521:19:34, 30 May 2021 (UTC) 2507:19:15, 30 May 2021 (UTC) 2493:17:58, 30 May 2021 (UTC) 2479:17:32, 30 May 2021 (UTC) 2464:14:59, 30 May 2021 (UTC) 2435:06:48, 2 June 2021 (UTC) 2420:17:41, 1 June 2021 (UTC) 2392:06:41, 1 June 2021 (UTC) 2377:05:07, 1 June 2021 (UTC) 2362:18:41, 31 May 2021 (UTC) 2211:21:46, 26 May 2021 (UTC) 2192:15:56, 11 May 2021 (UTC) 2171:22:46, 1 June 2021 (UTC) 1700:should be a redirect to 1573:polynomial factorization 4021:<ref group=note: --> 3890: 3876:10.4099/jjm1924.23.0_97 3604:Polar coordinate system 2708:04:06, 8 May 2021 (UTC) 2612:always a good reminder! 2609:Vertical and horizontal 2255:Polar coordinate system 2163:Jordan Mitchell Barrett 2159:Forcing (computability) 2149:19:13, 3 May 2021 (UTC) 2137:Forcing (computability) 1975:Jordan Mitchell Barrett 1927:Jordan Mitchell Barrett 1858:, which I've proposed. 1828:Forcing (computability) 1746:Jordan Mitchell Barrett 1659:Jordan Mitchell Barrett 1554:Jordan Mitchell Barrett 1481:Jordan Mitchell Barrett 1373:Jordan Mitchell Barrett 1357:Jordan Mitchell Barrett 1328:forcing (computability) 4025:{{reflist|group=note}} 3844:Cite journal requires 3725: 3576:I'm pulling data from 3538:38,176 1,231 Start Mid 3531:38,581 1,244 Start Low 3524:38,784 1,251 Start Low 3517:41,806 1,348 Start Mid 3510:43,152 1,392 Start Mid 3503:47,010 1,516 Start Low 3501:Bernoulli distribution 3496:52,201 1,683 Start Low 3489:61,931 1,997 Start Low 3265: 3230: 3136: 3058:Talk:Complex variables 2750:Riemann zeta functions 2671:FAR for Leonhard Euler 2602:Bernoulli distribution 2109:For your information, 2059: 2037: 1897:Computably inseparable 1856:Reduction (complexity) 1854:should be merged into 1848:Reduction (complexity) 1653: 1638: 1627: 1528:recursively enumerable 1524:recursively enumerable 1418:mathematical field of 1416:to articles about the 1239:Lowercase sigmabot III 3984:Quadratic reciprocity 3857:Oka, Kiyoshi (1953). 3765:Draft:Gaussian symbol 3726: 3289:It's surprising that 3266: 3231: 3137: 2844:Quadratic reciprocity 2733:doesn't make clear? — 2452:Missing square puzzle 2333:Problem of Apollonius 2060: 2038: 1888:Computably enumerable 1550:computably enumerable 1429:already redirects to 3706: 3675:A RM was started at 3515:Breadth-first search 3273:domain of holomorphy 3247: 3238:domain of holomorphy 3212: 3117: 2611:49,311 1,643 --: --> 2526:Convenience sampling 2454:91,834 3,061 Start-- 2047: 2025: 1611:Soare's 1996 essay " 1569:WP:original research 1510:Computability theory 1431:computability theory 1420:computability theory 1255:computability theory 3988:Arithmetic function 3977:Dirichlet character 3971:Dirichlet character 3677:Talk:Indecomposable 3088:Dirichlet character 2754:Euler zeta function 1800:should be moved to 1798:computable function 1792:In any case, if we 1702:computable function 1457:computable function 1383:Computable function 1346:primitive recursive 4027:template (see the 3721: 3261: 3226: 3132: 2354:Extraordinary Writ 2279:General relativity 2055: 2033: 1923:Decidable language 1919:Recursive language 1870:Computable ordinal 1838:. I tried to move 1515:Recursive function 1466:proposing to move 1437:Recursive function 1379:Recursive function 1324:computable ordinal 3767:to MfD vs. RfD.-- 3602:I have nominated 3480:Charles Hoskinson 3446:I've submitted a 3041:opinions again.-- 3013:Complex variables 3004: 2926:comment added by 2900:comment added by 2675:I have nominated 2249:1 − 2 + 3 − 4 + ⋯ 1866:Recursive ordinal 1392: 1308:recursive ordinal 1246: 1245: 95:Nov 2002–Dec 2003 4054: 4034: 4033: 4032: 4026: 4022: 3893:Euclid's theorem 3880: 3878: 3853: 3847: 3842: 3840: 3832: 3830: 3730: 3728: 3727: 3722: 3720: 3719: 3714: 3664:Requested move: 3657: 3646: 3494:Sigmoid function 3410:Jochen Burghardt 3399: 3395: 3394: 3270: 3268: 3267: 3262: 3260: 3235: 3233: 3232: 3227: 3225: 3141: 3139: 3138: 3133: 3131: 3130: 3125: 3017:Complex analysis 2996: 2942: 2916: 2704: 2644:By the way, can 2588:Sigmoid function 2262:Notice not given 2064: 2062: 2061: 2056: 2054: 2042: 2040: 2039: 2034: 2032: 2009:Jochen Burghardt 2003:? There is also 1607: 1506: 1504:Recursion theory 1445:out of the scope 1427:Recursion theory 1414:limited in scope 1411: 1395: 1390: 1376: 1241: 1225: 66: 59: 52: 42: 34: 4062: 4061: 4057: 4056: 4055: 4053: 4052: 4051: 4037: 4036: 4024: 4020: 4018: 4016: 3973: 3896: 3856: 3843: 3833: 3820: 3817: 3709: 3704: 3703: 3696: 3673: 3654: 3649: 3644: 3635: 3600: 3468: 3444: 3392: 3390: 3245: 3244: 3210: 3209: 3120: 3115: 3114: 3107: 3092:Robert McClenon 3080: 3020: 2984: 2921: 2895: 2847: 2821: 2764:infinite series 2702: 2673: 2574:Kelly criterion 2540:14,340 478 Stub 2534:16,592 553 Stub 2528:16,992 566 Stub 2449: 2321:Johannes Kepler 2219: 2045: 2044: 2023: 2022: 2001:CE (complexity) 1997:RE (complexity) 1601: 1502: 1405: 1393: 1386: 1370: 1251: 1237: 1226: 1220: 1211: 1097: 87: 86: 73: 70: 30: 29: 28: 12: 11: 5: 4060: 4058: 4050: 4049: 4039: 4038: 4014: 3972: 3969: 3968: 3967: 3966: 3965: 3895: 3889: 3888: 3887: 3854: 3816: 3813: 3745:I added it to 3718: 3713: 3695: 3692: 3672: 3666:Indecomposable 3662: 3652: 3641:interesting.-- 3634: 3631: 3599: 3596: 3595: 3594: 3593: 3592: 3564:David Eppstein 3540: 3539: 3532: 3525: 3522:Eric Weinstein 3518: 3511: 3504: 3497: 3490: 3483: 3476: 3467: 3464: 3443: 3440: 3439: 3438: 3437: 3436: 3435: 3434: 3358: 3357: 3356: 3355: 3331:David Eppstein 3327: 3326: 3325: 3324: 3323: 3259: 3255: 3252: 3224: 3220: 3217: 3199: 3129: 3124: 3106: 3103: 3079: 3074: 3073: 3072: 3019: 3009: 2983: 2980: 2979: 2978: 2977: 2976: 2957: 2917: 2846: 2840: 2820: 2814: 2795: 2794: 2779: 2735:David Eppstein 2726: 2725: 2677:Leonhard Euler 2672: 2669: 2642: 2641: 2640: 2639: 2638: 2637: 2636: 2635: 2634: 2633: 2632: 2631: 2621:David Eppstein 2614: 2613: 2606: 2605:maths classes? 2599: 2598:maths classes? 2592: 2591:maths classes? 2585: 2578: 2550: 2549: 2548: 2547: 2546: 2545: 2544: 2543: 2542: 2541: 2535: 2532:Welch's t-test 2529: 2499:David Eppstein 2448: 2445: 2444: 2443: 2442: 2441: 2440: 2439: 2438: 2437: 2397: 2396: 2395: 2394: 2384:David Eppstein 2349: 2348: 2342: 2336: 2330: 2324: 2318: 2315:Emery Molyneux 2312: 2306: 2300: 2294: 2288: 2282: 2276: 2259: 2258: 2252: 2218: 2215: 2214: 2213: 2195: 2194: 2176: 2175: 2174: 2173: 2152: 2151: 2107: 2106: 2088: 2087: 2086: 2085: 2084: 2083: 2082: 2081: 2071:David Eppstein 2053: 2031: 2005:R (complexity) 1988: 1987: 1986: 1985: 1968: 1967: 1952: 1942:David Eppstein 1908:David Eppstein 1900: 1899: 1890: 1881: 1879:Computable set 1872: 1817: 1816: 1791: 1788: 1780: 1779: 1778: 1777: 1776: 1775: 1765:David Eppstein 1738: 1737: 1727:David Eppstein 1720: 1687: 1680:Strong support 1676: 1675: 1674: 1673: 1672: 1671: 1670: 1669: 1654: 1646: 1639: 1631: 1628: 1620: 1609: 1592: 1591: 1590: 1589: 1588: 1587: 1543: 1542: 1494: 1493: 1492: 1491: 1477: 1476: 1475: 1460: 1434: 1400: 1399: 1389: 1334:respectively. 1300: 1299: 1289: 1269: 1268: 1265: 1262: 1250: 1247: 1244: 1243: 1231: 1228: 1227: 1222: 1218: 1216: 1213: 1212: 1210: 1209: 1154: 1098: 1096: 1095: 1040: 985: 930: 875: 820: 765: 710: 655: 600: 545: 490: 435: 380: 325: 270: 215: 160: 105: 84: 83: 82: 79: 78: 75: 74: 69: 68: 61: 54: 46: 43: 37: 31: 15: 14: 13: 10: 9: 6: 4: 3: 2: 4059: 4048: 4045: 4044: 4042: 4035: 4030: 4013: 4009: 4005: 4001: 3998: 3995: 3993: 3989: 3985: 3980: 3978: 3970: 3964: 3960: 3956: 3952: 3951: 3950: 3946: 3942: 3938: 3934: 3933: 3932: 3931: 3927: 3923: 3919: 3914: 3913: 3909: 3905: 3901: 3900:Euler product 3894: 3886: 3883: 3877: 3872: 3868: 3864: 3860: 3855: 3851: 3838: 3829: 3824: 3819: 3818: 3814: 3812: 3811: 3807: 3803: 3799: 3794: 3793: 3789: 3785: 3779: 3778: 3774: 3770: 3766: 3761: 3760: 3756: 3752: 3748: 3743: 3742: 3738: 3734: 3716: 3701: 3691: 3690: 3686: 3682: 3678: 3671: 3667: 3663: 3661: 3660: 3655: 3648: 3647: 3640: 3632: 3630: 3629: 3625: 3621: 3617: 3613: 3609: 3605: 3597: 3591: 3587: 3583: 3579: 3575: 3574: 3573: 3569: 3565: 3561: 3560: 3559: 3558: 3554: 3550: 3546: 3545: 3537: 3533: 3530: 3526: 3523: 3519: 3516: 3512: 3509: 3505: 3502: 3498: 3495: 3491: 3488: 3484: 3481: 3477: 3474: 3470: 3469: 3465: 3463: 3462: 3458: 3454: 3449: 3441: 3433: 3429: 3425: 3421: 3420: 3419: 3415: 3411: 3407: 3403: 3398: 3389: 3388: 3387: 3383: 3379: 3375: 3374: 3373: 3372: 3368: 3364: 3363:Michael Hardy 3354: 3350: 3346: 3342: 3341: 3340: 3336: 3332: 3328: 3322: 3318: 3314: 3310: 3306: 3305: 3304: 3300: 3296: 3292: 3288: 3287: 3286: 3282: 3278: 3274: 3253: 3250: 3243: 3239: 3218: 3215: 3208: 3203: 3197: 3193: 3189: 3185: 3181: 3177: 3173: 3169: 3165: 3160: 3159: 3158: 3157: 3153: 3149: 3145: 3127: 3112: 3104: 3102: 3101: 3097: 3093: 3089: 3085: 3078: 3075: 3071: 3067: 3063: 3059: 3055: 3054: 3053: 3052: 3048: 3044: 3038: 3037: 3033: 3029: 3025: 3018: 3014: 3010: 3008: 3007: 3003: 2999: 2995: 2994: 2989: 2981: 2975: 2971: 2967: 2962: 2958: 2956: 2952: 2948: 2944: 2943: 2941: 2937: 2933: 2929: 2925: 2918: 2915: 2911: 2907: 2903: 2899: 2892: 2891: 2890: 2889: 2886: 2883: 2879: 2875: 2872: 2869: 2865: 2861: 2857: 2852: 2845: 2841: 2839: 2838: 2834: 2830: 2826: 2819: 2815: 2813: 2812: 2808: 2804: 2800: 2793: 2789: 2785: 2780: 2778: 2774: 2770: 2766: 2765: 2759: 2755: 2751: 2747: 2746: 2745: 2744: 2740: 2736: 2732: 2724: 2720: 2716: 2712: 2711: 2710: 2709: 2706: 2705: 2698: 2694: 2690: 2686: 2682: 2678: 2670: 2668: 2667: 2663: 2659: 2655: 2651: 2647: 2630: 2626: 2622: 2618: 2617: 2616: 2615: 2610: 2607: 2603: 2600: 2596: 2593: 2589: 2586: 2582: 2579: 2575: 2572: 2571: 2570: 2566: 2562: 2558: 2557: 2556: 2555: 2554: 2553: 2552: 2551: 2539: 2536: 2533: 2530: 2527: 2524: 2523: 2522: 2518: 2514: 2510: 2509: 2508: 2504: 2500: 2496: 2495: 2494: 2490: 2486: 2482: 2481: 2480: 2476: 2472: 2468: 2467: 2466: 2465: 2461: 2457: 2453: 2446: 2436: 2432: 2428: 2423: 2422: 2421: 2417: 2413: 2408: 2403: 2402: 2401: 2400: 2399: 2398: 2393: 2389: 2385: 2380: 2379: 2378: 2374: 2370: 2366: 2365: 2364: 2363: 2359: 2355: 2346: 2345:Émile Lemoine 2343: 2340: 2337: 2334: 2331: 2328: 2325: 2322: 2319: 2316: 2313: 2310: 2307: 2304: 2301: 2298: 2295: 2292: 2289: 2286: 2283: 2280: 2277: 2274: 2271: 2270: 2269: 2267: 2263: 2256: 2253: 2250: 2247: 2246: 2245: 2243: 2239: 2237: 2233: 2228: 2224: 2216: 2212: 2208: 2204: 2200: 2197: 2196: 2193: 2189: 2185: 2184:Michael Hardy 2181: 2178: 2177: 2172: 2168: 2164: 2160: 2156: 2155: 2154: 2153: 2150: 2146: 2142: 2138: 2134: 2130: 2127: 2126: 2125: 2124: 2120: 2116: 2112: 2105: 2101: 2097: 2096:Ebony Jackson 2093: 2090: 2089: 2080: 2076: 2072: 2068: 2020: 2019: 2018: 2014: 2010: 2006: 2002: 1998: 1994: 1993: 1992: 1991: 1990: 1989: 1984: 1980: 1976: 1972: 1971: 1970: 1969: 1966: 1962: 1958: 1953: 1951: 1947: 1943: 1939: 1938: 1937: 1936: 1932: 1928: 1924: 1920: 1915: 1913: 1909: 1905: 1898: 1894: 1891: 1889: 1885: 1882: 1880: 1876: 1875:Recursive set 1873: 1871: 1867: 1864: 1863: 1862: 1859: 1857: 1853: 1849: 1845: 1841: 1837: 1833: 1829: 1825: 1821: 1815: 1811: 1807: 1803: 1799: 1795: 1785: 1782: 1781: 1774: 1770: 1766: 1762: 1757: 1756: 1755: 1751: 1747: 1742: 1741: 1740: 1739: 1736: 1732: 1728: 1724: 1721: 1719: 1715: 1711: 1707: 1703: 1699: 1695: 1691: 1685: 1681: 1678: 1677: 1668: 1664: 1660: 1655: 1652: 1647: 1644: 1640: 1637: 1632: 1629: 1626: 1621: 1618: 1614: 1610: 1605: 1600: 1599: 1598: 1597: 1596: 1595: 1594: 1593: 1586: 1582: 1578: 1574: 1570: 1565: 1564: 1563: 1559: 1555: 1551: 1547: 1546: 1545: 1544: 1541: 1537: 1533: 1529: 1525: 1521: 1517: 1516: 1511: 1507: 1505: 1499: 1496: 1495: 1490: 1486: 1482: 1478: 1473: 1469: 1465: 1461: 1458: 1454: 1450: 1446: 1442: 1438: 1435: 1432: 1428: 1425: 1424: 1422: 1421: 1415: 1409: 1404: 1403: 1402: 1401: 1398: 1394: 1384: 1380: 1374: 1369: 1368: 1367: 1366: 1362: 1358: 1353: 1351: 1347: 1343: 1339: 1335: 1333: 1329: 1325: 1321: 1317: 1313: 1309: 1305: 1297: 1293: 1290: 1287: 1282: 1278: 1277:computability 1274: 1273: 1272: 1266: 1263: 1260: 1259: 1258: 1256: 1248: 1240: 1235: 1230: 1229: 1215: 1214: 1208: 1204: 1200: 1196: 1192: 1188: 1184: 1180: 1176: 1172: 1168: 1164: 1160: 1159: 1155: 1153: 1149: 1145: 1141: 1137: 1133: 1129: 1125: 1121: 1117: 1113: 1109: 1105: 1104: 1100: 1099: 1094: 1090: 1086: 1082: 1078: 1074: 1070: 1066: 1062: 1058: 1054: 1050: 1046: 1045: 1041: 1039: 1035: 1031: 1027: 1023: 1019: 1015: 1011: 1007: 1003: 999: 995: 991: 990: 986: 984: 980: 976: 972: 968: 964: 960: 956: 952: 948: 944: 940: 936: 935: 931: 929: 925: 921: 917: 913: 909: 905: 901: 897: 893: 889: 885: 881: 880: 876: 874: 870: 866: 862: 858: 854: 850: 846: 842: 838: 834: 830: 826: 825: 821: 819: 815: 811: 807: 803: 799: 795: 791: 787: 783: 779: 775: 771: 770: 766: 764: 760: 756: 752: 748: 744: 740: 736: 732: 728: 724: 720: 716: 715: 711: 709: 705: 701: 697: 693: 689: 685: 681: 677: 673: 669: 665: 661: 660: 656: 654: 650: 646: 642: 638: 634: 630: 626: 622: 618: 614: 610: 606: 605: 601: 599: 595: 591: 587: 583: 579: 575: 571: 567: 563: 559: 555: 551: 550: 546: 544: 540: 536: 532: 528: 524: 520: 516: 512: 508: 504: 500: 496: 495: 491: 489: 485: 481: 477: 473: 469: 465: 461: 457: 453: 449: 445: 441: 440: 436: 434: 430: 426: 422: 418: 414: 410: 406: 402: 398: 394: 390: 386: 385: 381: 379: 375: 371: 367: 363: 359: 355: 351: 347: 343: 339: 335: 331: 330: 326: 324: 320: 316: 312: 308: 304: 300: 296: 292: 288: 284: 280: 276: 275: 271: 269: 265: 261: 257: 253: 249: 245: 241: 237: 233: 229: 225: 221: 220: 216: 214: 210: 206: 202: 198: 194: 190: 186: 182: 178: 174: 170: 166: 165: 161: 159: 155: 151: 147: 143: 139: 135: 131: 127: 123: 119: 115: 111: 110: 106: 104: 100: 96: 92: 89: 85:Earlier years 81: 80: 77: 76: 72: 67: 62: 60: 55: 53: 48: 47: 41: 36: 35: 27: 23: 19: 4017:Cite error: 4002: 3999: 3996: 3981: 3974: 3936: 3917: 3915: 3897: 3866: 3862: 3837:cite journal 3795: 3780: 3762: 3744: 3697: 3681:Adumbrativus 3674: 3642: 3636: 3601: 3542: 3541: 3487:666 (number) 3445: 3422:Thank you!-- 3396: 3359: 3195: 3191: 3187: 3183: 3179: 3175: 3171: 3167: 3163: 3108: 3081: 3039: 3021: 2992: 2985: 2960: 2928:Strecosaurus 2922:— Preceding 2902:Strecosaurus 2896:— Preceding 2870: 2864:Strecosaurus 2855: 2848: 2822: 2796: 2784:Adumbrativus 2761: 2727: 2700: 2674: 2643: 2581:666 (number) 2450: 2412:67.198.37.16 2406: 2369:67.198.37.16 2350: 2291:Emmy Noether 2285:Georg Cantor 2266:WP:URFA/2020 2261: 2260: 2242:Notice given 2241: 2240: 2236:WP:URFA/2020 2226: 2220: 2203:67.198.37.16 2198: 2179: 2141:73.89.25.252 2128: 2108: 2091: 1916: 1901: 1860: 1819: 1818: 1793: 1783: 1761:WP:TECHNICAL 1722: 1679: 1649: 1634: 1623: 1527: 1523: 1513: 1501: 1497: 1463: 1448: 1444: 1441:more general 1440: 1417: 1413: 1354: 1341: 1337: 1336: 1301: 1291: 1280: 1270: 1252: 1233: 1156: 1101: 1042: 1013: 987: 932: 877: 822: 767: 712: 657: 602: 547: 492: 437: 382: 327: 272: 217: 162: 107: 103:Sep–Dec 2004 99:Jan–Aug 2004 44: 4004:James in dc 3955:SilverMatsu 3922:SilverMatsu 3904:SilverMatsu 3802:SilverMatsu 3784:SilverMatsu 3769:SilverMatsu 3751:SilverMatsu 3747:Oka's lemma 3733:SilverMatsu 3453:Botterweg14 3424:SilverMatsu 3378:SilverMatsu 3345:SilverMatsu 3313:SilverMatsu 3148:SilverMatsu 3043:SilverMatsu 3028:SilverMatsu 3026:. thanks!-- 2842:Copyvio in 2769:SilverMatsu 2658:SilverMatsu 2595:Unit circle 2427:SilverMatsu 2339:Robert Hues 2111:user:Cewbot 1694:μ-recursion 4019:There are 3869:: 97–155. 3828:1807.08246 3190:such that 3178:satisfies 3166:satisfies 2993:S Marshall 2966:XOR'easter 2803:XOR'easter 2715:XOR'easter 2273:Archimedes 91:Motivation 4029:help page 3846:|journal= 3815:reference 3536:Transpose 3402:JayBeeEll 3309:arbitrary 3082:A draft, 3011:Retarget 2982:A pointer 2801:section. 2115:JRSpriggs 1904:Trovatore 1806:Trovatore 1784:Side note 1710:Trovatore 4041:Category 3645:Eostrix 3062:Paul_012 2936:contribs 2924:unsigned 2910:contribs 2898:unsigned 2874:contribs 2825:Gryllida 2762:Euler's 2303:0.999... 1957:D.Lazard 1912:D.Lazard 1684:User:CBM 1604:D.Lazard 1577:D.Lazard 1532:D.Lazard 1284:look at 24:‎ | 20:‎ | 4000:Thanks 3798:MarkH21 3582:Coin945 3549:Coin945 3271:is the 3236:is the 2945:Wow. -- 2561:Coin945 2513:Coin945 2485:Coin945 2456:Coin945 2199:Support 2180:Comment 2129:Comment 2092:Support 1820:Update: 1723:Comment 1408:MarkH21 1234:15 days 22:Archive 3990:, and 3891:about 3782:MfD.-- 3653:hoot🦉 3606:for a 3529:Googol 3295:Mgnbar 3242:domain 3207:domain 2833:e-mail 2703:buidhe 2679:for a 2347:(2008) 2341:(2009) 2335:(2008) 2329:(2011) 2323:(2007) 2317:(2008) 2311:(2008) 2305:(2010) 2299:(2008) 2293:(2008) 2287:(2007) 2281:(2008) 2275:(2007) 2257:(2007) 2251:(2007) 2227:before 1830:, and 1696:, and 1498:Oppose 3823:arXiv 3620:Z1720 2961:logic 1388:MarkH 1381:with 1342:every 1338:Note: 16:< 4008:talk 3959:talk 3945:talk 3926:talk 3908:talk 3850:help 3806:talk 3788:talk 3773:talk 3755:talk 3737:talk 3685:talk 3624:talk 3616:here 3586:talk 3568:talk 3553:talk 3534:230 3527:226 3520:224 3513:196 3506:188 3499:156 3492:131 3471:910 3457:talk 3428:talk 3414:talk 3397:Done 3382:talk 3367:talk 3349:talk 3335:talk 3317:talk 3299:talk 3281:talk 3152:talk 3096:talk 3066:talk 3047:talk 3032:talk 2970:talk 2951:talk 2932:talk 2906:talk 2882:Emil 2878:talk 2868:talk 2829:talk 2816:Re: 2807:talk 2788:talk 2773:talk 2739:talk 2719:talk 2689:here 2662:talk 2652:and 2625:talk 2565:talk 2517:talk 2503:talk 2489:talk 2475:talk 2460:talk 2431:talk 2416:talk 2388:talk 2373:talk 2358:talk 2232:here 2207:talk 2188:talk 2167:talk 2145:talk 2135:not 2119:talk 2100:talk 2075:talk 2013:talk 1979:talk 1961:talk 1946:talk 1931:talk 1906:and 1810:talk 1769:talk 1750:talk 1731:talk 1714:talk 1708:. -- 1663:talk 1581:talk 1558:talk 1552:. -- 1536:talk 1485:talk 1361:talk 1348:and 1330:and 1314:and 1158:2024 1103:2023 1044:2022 989:2021 934:2020 879:2019 824:2018 769:2017 714:2016 659:2015 604:2014 549:2013 494:2012 439:2011 384:2010 329:2009 274:2008 219:2007 164:2006 109:2005 26:2021 3979:. 3941:JBL 3885:TeX 3882:PDF 3871:doi 3800:.-- 3485:88 3478:31 3473:Nim 3277:JBL 3015:to 2947:JBL 2767:.-- 2691:. ( 2471:JBL 2407:lot 2223:FAR 2043:to 1842:to 1834:to 1826:to 1794:did 1470:to 1207:Dec 1203:Nov 1199:Oct 1195:Sep 1191:Aug 1187:Jul 1183:Jun 1179:May 1175:Apr 1171:Mar 1167:Feb 1163:Jan 1152:Dec 1148:Nov 1144:Oct 1140:Sep 1136:Aug 1132:Jul 1128:Jun 1124:May 1120:Apr 1116:Mar 1112:Feb 1108:Jan 1093:Dec 1089:Nov 1085:Oct 1081:Sep 1077:Aug 1073:Jul 1069:Jun 1065:May 1061:Apr 1057:Mar 1053:Feb 1049:Jan 1038:Dec 1034:Nov 1030:Oct 1026:Sep 1022:Aug 1018:Jul 1014:Jun 1010:May 1006:Apr 1002:Mar 998:Feb 994:Jan 983:Dec 979:Nov 975:Oct 971:Sep 967:Aug 963:Jul 959:Jun 955:May 951:Apr 947:Mar 943:Feb 939:Jan 928:Dec 924:Nov 920:Oct 916:Sep 912:Aug 908:Jul 904:Jun 900:May 896:Apr 892:Mar 888:Feb 884:Jan 873:Dec 869:Nov 865:Oct 861:Sep 857:Aug 853:Jul 849:Jun 845:May 841:Apr 837:Mar 833:Feb 829:Jan 818:Dec 814:Nov 810:Oct 806:Sep 802:Aug 798:Jul 794:Jun 790:May 786:Apr 782:Mar 778:Feb 774:Jan 763:Dec 759:Nov 755:Oct 751:Sep 747:Aug 743:Jul 739:Jun 735:May 731:Apr 727:Mar 723:Feb 719:Jan 708:Dec 704:Nov 700:Oct 696:Sep 692:Aug 688:Jul 684:Jun 680:May 676:Apr 672:Mar 668:Feb 664:Jan 653:Dec 649:Nov 645:Oct 641:Sep 637:Aug 633:Jul 629:Jun 625:May 621:Apr 617:Mar 613:Feb 609:Jan 598:Dec 594:Nov 590:Oct 586:Sep 582:Aug 578:Jul 574:Jun 570:May 566:Apr 562:Mar 558:Feb 554:Jan 543:Dec 539:Nov 535:Oct 531:Sep 527:Aug 523:Jul 519:Jun 515:May 511:Apr 507:Mar 503:Feb 499:Jan 488:Dec 484:Nov 480:Oct 476:Sep 472:Aug 468:Jul 464:Jun 460:May 456:Apr 452:Mar 448:Feb 444:Jan 433:Dec 429:Nov 425:Oct 421:Sep 417:Aug 413:Jul 409:Jun 405:May 401:Apr 397:Mar 393:Feb 389:Jan 378:Dec 374:Nov 370:Oct 366:Sep 362:Aug 358:Jul 354:Jun 350:May 346:Apr 342:Mar 338:Feb 334:Jan 323:Dec 319:Nov 315:Oct 311:Sep 307:Aug 303:Jul 299:Jun 295:May 291:Apr 287:Mar 283:Feb 279:Jan 268:Dec 264:Nov 260:Oct 256:Sep 252:Aug 248:Jul 244:Jun 240:May 236:Apr 232:Mar 228:Feb 224:Jan 213:Dec 209:Nov 205:Oct 201:Sep 197:Aug 193:Jul 189:Jun 185:May 181:Apr 177:Mar 173:Feb 169:Jan 158:Dec 154:Nov 150:Oct 146:Sep 142:Aug 138:Jul 134:Jun 130:May 126:Apr 122:Mar 118:Feb 114:Jan 4043:: 4031:). 4010:) 3986:, 3961:) 3947:) 3928:) 3920:-- 3910:) 3867:27 3865:. 3861:. 3841:: 3839:}} 3835:{{ 3808:) 3790:) 3775:) 3757:) 3739:) 3687:) 3668:→ 3626:) 3618:. 3588:) 3570:) 3555:) 3547:-- 3459:) 3430:) 3416:) 3384:) 3369:) 3351:) 3337:) 3319:) 3301:) 3283:) 3254:⊂ 3219:⊂ 3154:) 3098:) 3068:) 3049:) 3034:) 2990:.— 2972:) 2953:) 2938:) 2934:• 2912:) 2908:• 2885:J. 2835:) 2831:, 2809:) 2790:) 2775:) 2741:) 2721:) 2699:) 2695:· 2664:) 2648:, 2627:) 2567:) 2519:) 2505:) 2491:) 2477:) 2462:) 2433:) 2418:) 2390:) 2375:) 2360:) 2209:) 2190:) 2169:) 2147:) 2139:. 2121:) 2102:) 2077:) 2015:) 1981:) 1963:) 1948:) 1933:) 1895:⇒ 1886:⇒ 1877:⇒ 1868:⇒ 1812:) 1771:) 1752:) 1733:) 1716:) 1665:) 1645:": 1583:) 1560:) 1538:) 1530:. 1487:) 1479:-- 1464:am 1462:I 1449:If 1391:21 1363:) 1355:-- 1326:, 1322:, 1310:, 1306:, 1205:· 1201:· 1197:· 1193:· 1189:· 1185:· 1181:· 1177:· 1173:· 1169:· 1165:· 1161:: 1150:· 1146:· 1142:· 1138:· 1134:· 1130:· 1126:· 1122:· 1118:· 1114:· 1110:· 1106:: 1091:· 1087:· 1083:· 1079:· 1075:· 1071:· 1067:· 1063:· 1059:· 1055:· 1051:· 1047:: 1036:· 1032:· 1028:· 1024:· 1020:· 1016:· 1012:· 1008:· 1004:· 1000:· 996:· 992:: 981:· 977:· 973:· 969:· 965:· 961:· 957:· 953:· 949:· 945:· 941:· 937:: 926:· 922:· 918:· 914:· 910:· 906:· 902:· 898:· 894:· 890:· 886:· 882:: 871:· 867:· 863:· 859:· 855:· 851:· 847:· 843:· 839:· 835:· 831:· 827:: 816:· 812:· 808:· 804:· 800:· 796:· 792:· 788:· 784:· 780:· 776:· 772:: 761:· 757:· 753:· 749:· 745:· 741:· 737:· 733:· 729:· 725:· 721:· 717:: 706:· 702:· 698:· 694:· 690:· 686:· 682:· 678:· 674:· 670:· 666:· 662:: 651:· 647:· 643:· 639:· 635:· 631:· 627:· 623:· 619:· 615:· 611:· 607:: 596:· 592:· 588:· 584:· 580:· 576:· 572:· 568:· 564:· 560:· 556:· 552:: 541:· 537:· 533:· 529:· 525:· 521:· 517:· 513:· 509:· 505:· 501:· 497:: 486:· 482:· 478:· 474:· 470:· 466:· 462:· 458:· 454:· 450:· 446:· 442:: 431:· 427:· 423:· 419:· 415:· 411:· 407:· 403:· 399:· 395:· 391:· 387:: 376:· 372:· 368:· 364:· 360:· 356:· 352:· 348:· 344:· 340:· 336:· 332:: 321:· 317:· 313:· 309:· 305:· 301:· 297:· 293:· 289:· 285:· 281:· 277:: 266:· 262:· 258:· 254:· 250:· 246:· 242:· 238:· 234:· 230:· 226:· 222:: 211:· 207:· 203:· 199:· 195:· 191:· 187:· 183:· 179:· 175:· 171:· 167:: 156:· 152:· 148:· 144:· 140:· 136:· 132:· 128:· 124:· 120:· 116:· 112:: 101:· 97:· 93:· 4006:( 3957:( 3943:( 3924:( 3906:( 3879:. 3873:: 3852:) 3848:( 3831:. 3825:: 3804:( 3786:( 3771:( 3753:( 3735:( 3717:n 3712:C 3683:( 3656:) 3650:( 3622:( 3584:( 3566:( 3551:( 3455:( 3426:( 3412:( 3380:( 3365:( 3347:( 3333:( 3315:( 3297:( 3279:( 3258:C 3251:D 3223:C 3216:D 3196:x 3194:( 3192:F 3188:x 3184:x 3182:( 3180:F 3176:x 3172:x 3170:( 3168:F 3164:x 3150:( 3128:n 3123:C 3094:( 3064:( 3045:( 3030:( 3002:C 3000:/ 2998:T 2968:( 2949:( 2930:( 2904:( 2871:· 2866:( 2827:( 2805:( 2786:( 2771:( 2752:( 2737:( 2717:( 2697:c 2693:t 2660:( 2623:( 2563:( 2515:( 2501:( 2487:( 2473:( 2458:( 2429:( 2414:( 2386:( 2371:( 2356:( 2205:( 2186:( 2165:( 2143:( 2117:( 2098:( 2073:( 2052:I 2030:Z 2011:( 1977:( 1959:( 1944:( 1929:( 1808:( 1767:( 1748:( 1729:( 1712:( 1661:( 1606:: 1602:@ 1579:( 1556:( 1534:( 1483:( 1474:. 1410:: 1406:@ 1375:: 1371:@ 1359:( 1242:. 71:) 65:e 58:t 51:v

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