text:
Thrashcore

Thrashcore (also known as fastcore) is a fast-tempo subgenre of hardcore punk that emerged in the early 1980s. Thrashcore is essentially sped-up hardcore, adopting a slightly more extreme style by means of its vocals, dissonance, and occasional use of blast beats. Songs are usually very brief, and thrashcore is in many ways a less dissonant, minimally metallic forerunner of grindcore. The genre is sometimes associated with the skateboarder subculture.

Terminological ambiguity
Thrashcore is often confused with crossover thrash and sometimes thrash metal. Further confusion is added by the fact that many crossover bands, such as D.R.I., began as influential thrashcore bands. Throughout the '80s, the term "thrash" was in use as a synonym for hardcore punk (as in the New York Thrash compilation of 1982). It eventually came to be used for the faster, more intense style of hardcore punk. The term thrashcore is of recent vintage but dates from at least 1993. The "-core" suffix is necessary to distinguish it from the thrash metal scene, which is also referred to as "thrash" by fans. Still more confusingly, the term "thrashcore" is occasionally used by the music press to refer to thrash metal-inflected metalcore.

Origins
Just as hardcore punk groups distinguished themselves from their punk rock predecessors by their greater intensity and aggression, thrashcore groups (often identified simply as "thrash") sought to play at breakneck tempos that would radicalize the innovations of hardcore. Early American thrashcore groups included Cryptic Slaughter (Santa Monica), D.R.I. (Houston), HYPE (Toronto, Canada), Septic Death (Boise, Idaho) and Siege (Weymouth, Massachusetts). The British Electro Hippies, the Dutch Lärm, the Italian Raw Power, and the Japanese S.O.B. also practiced important examples of the style. Some of Negative Approach's later work was influential on the scene.

Powerviolence
The powerviolence scene grew out of thrashcore as an American counterpart to the British grindcore scene, which had emerged from crust punk, with bands such as Septic Death, Infest and Siege being the first to move towards the style. Powerviolence groups saw themselves as distinct from grindcore because of the increasing proximity of grindcore groups to the death metal being performed in Florida, Sweden, and Brazil. Powerviolence groups wished to avoid the association with heavy metal music and culture that crossover thrash, thrash metal, and grindcore had made, while also incorporating "tempo changes with droney and sludgey down tempo parts". As well as from thrashcore, powerviolence groups also took inspiration from crust punk, and eventually from noise music. Main groups associated with powerviolence included No Comment, Hellnation, Man Is The Bastard, Crossed Out, Charles Bronson, Spazz and Rorschach.

Grindcore
Thrashcore groups such as S.O.B.,  Cryptic Slaughter, Siege and Deep Wound were major influences on early grindcore acts such as Napalm Death, Carcass and Repulsion. Grindcore is considered to be more metallic, due to its influence from crust punk.

Revival
The '90s saw a revival of the thrashcore style, as groups that had previously been associated with powerviolence or grindcore began to explore their debt to this earlier form of extreme music such as rock and metal. This was sometimes referred to as bandana thrash, in reference to the headgear preferred by many of the performers. Prominent '90s thrashcore groups included Code 13, MK-ULTRA, Guyana Punch Line, What Happens Next? and R.A.M.B.O. (from the United States), Vitamin X (from the Netherlands), Vivisick (from Japan) and Voorhees (from the UK). These groups sometimes felt a greater association with other elements of '80s hardcore punk, such as straight edge, anarcho-punk, youth crew, or crust punk, than most initial thrashcore groups did.

Record labels

 * 625 Thrashcore
 * Havoc Records
 * Ebullition Records
 * Slap-a-Ham Records
 * Deep Six Records
 * Six Weeks
 * Sound Pollution Records

title: Thrashcore


text:
65th Infantry Division

65th Infantry Division could refer to:

 * 65th Infantry Division (Russian Empire)
 * 65th Infantry Division (United States)
 * 65th Infantry Division (Wehrmacht)

license: Creative Commons - Attribution Share-Alike - https://creativecommons.org/licenses/by-sa/4.0/

title: 65th Infantry Division


text:
Talk:Samson Raphael Hirsch

Opposition to Zionism
Can someone offer sources about RSH opposition to Zionism? Was there really an organized Zionist movement for him to oppose during his lifetime? — Preceding unsigned comment added by Dc3736 (talk • contribs) 13:42, 17 July 2022 (UTC)

What does Derekh Eretz mean?
Now that JFW and Danny bring this up, this is worth getting into. The more right-wing of Hirsch's supporters agree with Danny's translation and JFW's views. However, I do not understand why. The Mishna was written nearly 2,000 years ago. Hirsch wrote only 200 years ago, in a totally diffeerent historical situation and society. In any case, people who support this POV hold that Rabbi Hirsch only wanted Jews to combine observant Jewish lifestyle (including lifelong Torah learning) with learning the surrounding gentile society's language, history, science, etc., so that a religious Jew could earn a living in the surrounding gentile society. In this Orthodox view, learning of these "gentile" subjects is not considered problematic, since it doesn't encroach on gentile philosophy, music, art, literature or ethics. RK

However, many other of Hirsch's supporters say that this understanding of Hirsch's philosophy is misguided; they have even gone so far as to call the bad historical revisionism. This issue has been discussed in articles in Tradition: A Journal of Orthodox Thought, published by the Rabbinical Council of America (RCA). In this Orthodox view, Rabbi Hirsch wanted more than just the study of the surrounding gentile society's language, history, science. He also thought that it was permissible, and even productive, for Jews to learn gentile philosophy, music, art, literature or ethics. Hirsch himself studied gentile philosophy, and so did many of his later adherents, including Rabbi Joseph Soloveitchik and many other rabbis in the RCA. However, this view is considered forbidden by many Orthodox Jews; they generally refuse to study such subjects. As this is an important issue of discussion in the Orthodox Jewish community even today, both sides should be represented in this article. RK

On this subject, see Revisionism and the Rav: The Struggle for the Soul of Modern Orthodoxy, published in Judaism, Summer, 1999, by Lawrence Kaplan.

 * THERE IS A MAJOR STRUGGLE CURRENTLY TAKING PLACE within the modern Orthodox community, a struggle over the correct understanding of the person and teachings of Rav Joseph B. Soloveitchik, ztz"l, better known simply as the Rav. The Rav, one of the towering rabbinic scholars and thinkers of our era, was, as is well known, the teacher, guide, and, above all, the supreme halakhic and hashkafic authority of the modern Orthodox community for over fifty years. The struggle, then, is not just scholarly, but ideological as well. Indeed, in the deepest sense, it is a struggle over the direction and future course of the modern Orthodox community, a struggle over its very soul.

 * This type of struggle is not new to the modern Orthodox community. If we look at other rabbinic heroes of modern Orthodoxy, for example, Rav Samson Raphael Hirsch (1808-1888), founder of enlightened German neo-Orthodoxy, rabbinic scholar, Biblical commentator, and communal leader, or Rav Abraham Isaac Kook (1865-1935), the first Chief Rabbi of mandatory Palestine, talmudist, kabbalist, poet, communal leader, and Orthodox herald of the Jewish national renewal, we find that their persons and teachings as well have been and, indeed, still are the subjects of intense, often heated debate. Nor should this be surprising. Rav Hirsch, Rav Kook, and the Rav were, in different ways, very rich, complex figures: major rabbinic scholars who at the same time seriously engaged modernity intellectually; individuals whose teachings and persons blended together, in striking ways, conservatism and innovation, strict traditionalism and intellectual daring. It is intrinsically difficult to paint nuanced intellectual portraits that will do justice to the richness of their religious legacies. Moreover, different elements of the modern Orthodox community focus on those aspects in the teachings of these figures that they find intellectually or religiously congenial and gloss over those aspects they find uncongenial. Thus, the more modern, "left wing" elements of the modern Orthodox community tend to focus on the more innovative, humanistic, and universalist aspects of the legacies of these three giants, and minimize the more conservative, authoritarian, and particularist aspects of their legacies, while that community's more traditional, "right wing" elements simply reverse the order of priority.

The author of this article notes that some promimnent rabbis warn that there is a tendency for those on the right-wing of Orthodox to rewrite modern Orthodox thinkers, such as Hirsch and Soloveitchik. In the attempted revisionism, the person is presented as being less modern and more Haredi. For example

 * Shortly after the Rav's passing, Rabbi Norman Lamm, President of Yeshiva University, in a eulogy for the Ray delivered on April 25, 1993, urged his auditors to "guard...against any revisionism, any attempts to misinterpret the Ray's work in both worlds [the world of Torah and the world of Madda]. The Ray was not a lamdan who happened to have and use a smattering of general culture, and he was certainly not a philosopher who happened to be a talmid hakham, a Torah scholar.... We must accept him on his terms, as a highly complicated, profound, and broad-minded personality.... Certain burgeoning revisionisms may well attempt to disguise and distort the Rav's uniqueness by trivializing one or the other aspect of his rich personality and work, but they must be confronted at once." [3]

 * (3.) Norman Lamm, "A Eulogy for the Rav," Tradition 28.1 (1993): 13. R. Lamm's reference to those who seek to "trivializ[e]] one or the other aspect of [the Rav's] rich personality" implies that "burgeoning revisionisms" can come from either the "left" or the "right" In fact, however, by far the most significant revisionism has come from the right, certainly in print, and it is this form of revisionism, particularly in its latest and most extreme manifestation, that deserves our scrutiny. At the same time, there have also been attempts at revisionism from the left, though these attempts have been made orally and, to the best of my knowledge, are not to be found in writing; I will therefore also examine a revealing example of this brand of revisionism.

Intellectual disagreement, but not Wiki Edit disagreement
Firstly, do not falsify history by ascribing Modern Orthodox Judaism to Rav Hirsch. Secondly, the sources you quote above are all about Joe Soloveitchik. Can we stick to Rav Hirsch, please?

 * JFW, please note that many modern historians of Judaism identify him as the father of Modern Orthodox Judaism. This identification is accepted as factual by Modern Orthodox Jews themselves, and by non-Orthodox rabbis. I have no objections to stating this in an NPOV way. I thus have no objections with your revisions and edits. RK 14:26, Aug 8, 2004 (UTC)

There is indeed a struggle about his legacy. This has been dealt with extensively in the article (at the bottom) and it the seperate article Torah im Derech Eretz. JFW

 * It seems to me that no extensive discussion is there; the topic was briefly alluded to. It needs a fuller treatment, with sources and quotes, to present the subject in its historical context. Please consider my point in the Talk page there to merge the content of that article with this one, and with the article on Modern Orthodoxy. RK 14:26, Aug 8, 2004 (UTC)

Torah im Derech Erezt has a narrow and a wide definition, and the wide definition (incorporating all of secular culture in a Jewish framework) has been largely abandoned. Yes, Rav Hirsch praised Schiller at school ceremonies, but if you take the care to read his polemics with Graetz, Frankel and other contemporaries, you might arrive at an understanding why Rav Hirsch cannot be described as the father of Modern Orthodoxy. Just read his writings - he does not encourage the fields of study you refer to.

 * I would dispute this; it seems to me that the wide definition of his philosophy is still around today. I live near a few Modern Orthodox synagogues which embrace this wide definition, I know of a many O rabbis which teach it, and I own books by Orthodox Jews on this subject. We can explain why some disagree with these liberal forms of Orthodoxy, but we must not deny that they exist. RK

 * Further, I have read some of Hirsch's polemics with Graetz, Frankel and other contemporaries...and these were not Orthodox Jews. Graetz was a proto-Reform Jew, Frankel was a proto-Conservative Jew. Few would relate these groups with modern Orthodoxy. (Both then and today, some Haredi leaders hold that Modern Orthodoxy is reform Judaism in disguise, but this claim is viewed as polemical by non-Haredim.) Your references, of course, do show that Hirsch was not the father of Reform Judaism or of Conservative Judaism; I agree with that. RK

If you have problems with this, just edit the article to reflect that "some say..."... "others say....", and don't try to convince me that Hirsch would endorse present-day modern orthodoxy. JFW | T@lk  12:10, 25 Jul 2004 (UTC)

 * Your formulation is Ok by me. RK 14:20, Aug 8, 2004 (UTC)

My edits of 8/8/2004
RK's edits are on the whole well taken, but here are some points:
 * Moravia had no organised reform community when Hirsch was Chief Rabbi there.
 * The Bürger- and Realshule were two different schools, the latter for the community children, and the former mainly for Eastern-European refugees.
 * The Kaplan reference was removed. This has 100% to do with Rabbi Soloveitchik and very little with Hirsch per se. JFW | T@lk  11:21, 8 Aug 2004 (UTC)

Theological reason for science study
The article states "While being a yeshiva student in Eastern Europe, Rabbi Shimon Schwab obtained the views of various poskim (authorities in Jewish law) on the required level of secular knowledge (Levi 1990). On this basis, many Ultra-Orthodox adherents of Hirsch's philosophy have preferred the natural sciences over the humanities as a subject of secular study."

 * From personal conversations with a small number of right-wing Orthodox rabbis (maybe Haredi, maybe right Modern Orthodox) it seems to me that there is an additional, significant reason that many Orthodox (of all forms) study natural sciences: theological. The study of natural science is the study of God's handiwork; the study of physics is the study of laws created by God. Thus one can come to the same position as Hirsch (these secular subjects can and should be studied) for perhaps a different reason. (Then again, maybe Hirsch felt the same way about science. I do not know.) If you find rabbis of importance who have written on this topic, this subject may find itself into some article. RK

 * Rabbi Dr. Eliezer Berkovits, in Knowledge of the World, Knowledge of G-d (in Essential Essays on Judaism, Shalem Press, ed. Hazony), points out (following Rambam, Kuzari, and Hovot haLevavot), that the epistemological path is well paved for us to see secular learning as another of the truths which G-d has planted in this world; no real great effort is required to utilize this perspective nowadays. It has been said that Rabbi Hirsch's Torah im Derech Eretz is really just a recreation of what was true in Muslim Spain.
 * Berkovits (ibid.) also points out, likely from the influence of his teacher (R' Akiva Glasner)'s father (R' Moshe Shmuel Glasner), who in turn followed the Hatam Sofer (from whom Glasner was descended), that at least in Eretz Yisrael, it is untenable to claim that Jewry can survive without technical knowledge and ability; G-d commanded us to have a state, and concomitantly this demands the requisite knowledge and technical skill. Cf. the elder Glasner's haTzionut b'Ohr haEmuna/Zionism in the Light of Faith.
 * As for Rabbi Hirsch's perspective on this matter, Rabbi Natan Slifkin quotes Rabbi Hirsch (at http://www.torah.org/features/secondlook/sciencewars.html) as saying,"'Judaism is most anxious to make its adherents aware that all the phenomena of nature are subject to certain unchanging laws. Since Judaism itself is a system of laws through and through, it attaches a profound ethical value to the study of the natural sciences. Judaism considers it vitally important for its adherents to become aware that their entire universe is governed by well-defined laws, that every creature on earth becomes what it is only within the framework of fixed laws, and that every force in nature can operate only within specified limits. Not by his whims of the moment but only by his own detailed knowledge of, and regard for, these laws can man make nature serve his purposes. Man himself, then, can exercise power only if he, in turn, obeys the laws set down for him and for his world." In like vein, Rabbi Dr. Yehuda (Leo) Levi says (at http://www.hra.jct.ac.il/judaica/dvarTorah/dt11.html; Levi is not quoting Hirsch, but he is known to be a staunch Hirschian),"The fulfillment of the Torah demands a world and rules that control it. To convince ourselves of the need for these laws, we need only try to imagine a world operating in an arbitrary fashion, without rules. Imagine if, when you sow seeds, you would have no idea whether wheat or weeds will come up. Or whether a particular effort will cause your hand to go up or down. Clearly, in such circumstances you would have no control, either of the world around you or of your own actions. You would feel like a puppet; your life would be totally passive. The laws of nature, then, are a condition for the commandments of the Torah to be operational. If God wants us to keep His commandments, He must give us the necessary tools, including reliable laws of nature. This may have been one of the prophet's meanings when he said in God's name: 'If not for My covenant, day and night, I would not have established the laws of heaven and Earth.'" Sevendust62 (talk) 15:37, 17 March 2009 (UTC)

To be very frank, most Haredim who study secular sciences do so to gain a livelihood. I don't know if the situation is the same in Modern Orthodox circles. I do not disagree that it is a mitzvah to Love God, and that this may be achieved by admiring His handiwork, but this was not the context of Rav Schwab's question. Rabbi Bloch (of Telz/Tilsiai), Rabbi Wasserman, Rabbi Leibovitz and Rabbi Rosen gave various answers, but none seriously dealt with the point you've raised. In recent years, study of science has been replaced with Torah study, and that's that. JFW | T@lk  21:09, 8 Aug 2004 (UTC)

Featured article?
Do you think that the article is ready to become a FA? Tomer T 20:18, 3 April 2007 (UTC)

 * Never noticed this post until now. I think the article needs much more work to become FA. JFW | T@lk  10:19, 9 January 2011 (UTC)

Note on Hirsch Siddur
¶ I am keenly aware of the Wikipedia rule that everything must have a published source - but I violated that by providing what I thought was important information based on my own experience. The Hirsch Siddur: The order of prayers for the whole year, published in English translation by Feldheim Publishers, of NY, in 1969 and reprinted with corrections in 1978, for the Samson Raphael Hirsch Publications Society, uses the translations of the prayers and the commentary written by Hirsch in German, but the facing Hebrew pages are NOT edited by Hirsch at all, but are simply reprinted from a very ordinary public-domain Orthodox siddur. This fact was personally conveyed to me, circa 1994, by one of the surviving Feldheim brothers, who remembered doing the cut-an-paste on the galley proofs on his parents' kitchen table back in 1969. Although (as far as I know) this fact has not been printed anywhere, I thought it worth perpetuating, lest someone suppose that a reading in the Hebrew pages had the particular approval of Hirsch. Sussmanbern (talk) 13:01, 3 October 2011 (UTC); I have restored my comment after it was deleted, evidently by someone who hadn't read this note. I believe that this is significant information, as otherwise a peculiar rendering of the Hebrew pages in the siddur might be thought to possess Hirsch's approbation. There are instances where Hirsch's translation clearly departs from the Hebrew pages; e.g. Hirsch omits (as does Hertz, Singer, et al.) Al tiro following Aleinu (page 211). Sussmanbern (talk) 01:51, 23 October 2011 (UTC)

 * You are engaging in original research by adding points based on your personal experience or knowledge. Consider publishing this fact elsewhere, so it can then be cited. I too have noticed certain discrepancies e.g. in the wording of Atto Chonein.
 * Have you considered contacting the Hirsch Publication Society and asking whether they might consider printing a new edition that is closer to the original German edition. Does that edition follow Heidenheim, or has he incorporated the additions and changes by Baer also? JFW | T@lk  09:22, 23 October 2011 (UTC)

Mrs. SR Hirsch
No mention at all in the article of his marriage/wife. 69.118.3.165 (talk) 03:51, 24 October 2013 (UTC)

 * Her name is mentioned in the infobox; little is mentioned about her background in Klugman's biography. Her maiden name was Juedel and IIRC she was from Braunschweig. JFW | T@lk  10:34, 28 April 2020 (UTC)

External links modified
Hello fellow Wikipedians,

I have just modified one external link on Samson Raphael Hirsch. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:
 * Added archive https://web.archive.org/web/20050918222757/http://www.tzemachdovid.org/gedolim/breuer.gif to http://www.tzemachdovid.org/gedolim/breuer.gif

When you have finished reviewing my changes, you may follow the instructions on the template below to fix any issues with the URLs.

Cheers.— InternetArchiveBot  (Report bug) 06:14, 28 November 2017 (UTC)

title: Talk:Samson Raphael Hirsch


text:
Talk:Cook–Levin theorem

Different proof
My proof in this article differs from the one given by Garey and Johnson. My Boolean expression B contains the disjunction of the possible transitions for a tape position/computation step (thus requiring at least one transition), whereas the G&J proof contains the conjunction (thus requiring all transitions, which seems wrong). See the definition of group G6, page 43 of the 1997 edition. I think this is a trivial mistake on G&J's part as G&J make it clear what they mean in the table on page 42. But I would appreciate someone to check my working. Gdr 21:00, 2004 Jul 21 (UTC)

 * In December 2008 your proof was edited, and at present there is no disjunction over possible transitions for a given state-symbol pair. That means the formula states that all applicable transitions must be satisfied (instead of one of them). Hence the construction is correct only for deterministic machines, which of course does not cover NP :) Jochgem (talk) 10:30, 22 April 2011 (UTC) (added:) I just noted this is what Jjldj already noted on 17 February 2009 under Clause Conjunction Table below.

Wrong definition
Isn't the first sentence under "Definitions" in the Cook's Theorem page wrong? Shouldn't it read as follows: "A decision problem is in NP if a deterministic Turing machine can verify a proposed solution of the decision problem in polynomial time. Equivalently, a decision problem is in NP if a non-deterministic Turing machine can solve the decision problem in polynomial time." This is more consistent with the definitions on the "NP" page. Rodney Topor 04:59, 29 October 2006 (UTC)

CSAT
I believe that the actual Cook-Levin theorem, at least as taught at GU, MIT, and Columbia, and as written in the seminal algorithms textbook CLRS, is actually the CSAT problem, for which no entry on Wikipedia even exists. After CSAT was shown to be NP-Complete, they reduced SAT to CSAT, and then 3SAT to SAT. Perhaps I'm mistaken, but I think that this article is incorrect. I noticed this b/c I'm a student taking algorithms at MIT, and what they taught us contradicts this article. 18.224.0.172 (talk) 01:14, 17 November 2009 (UTC)

 * Currently, there is a page on Circuit-SAT (=CSAT). Note that the approach to show that an NP-complete problem exists in CLRS is not the Cook-Levin theorem. A difference is that the Cook-Levin theorem shows NP-hardness of SAT with respect to logspace reductions, while CLRS uses polynomial time reductions to show NP-hardness of CSAT. As a logspace reduction can be performed in polynomial time, the Cook-Levin theorem is a bit stronger than the result in CLRS. I think CLRS have chosen to use polynomial time reductions because it allows them to prove all results within the RAM model and avoids the introduction of Turing machines. This makes the presentation simpler when coming from an algorithmic perspective. ShearedLizard (talk) 10:10, 22 May 2018 (UTC)

Merge
I agree that the Proof that Boolean satisfiability problem is NP-complete page should be merged into the Cook's Theorem page. There already is a proof in the the Cook's Theorem page that is more concise, more precise, and more complete. The other proof ignores the polynomial-time requirement of the reduction. I would go further and recommend the "Proof" page be deleted as it is redundant. Rodney Topor 05:47, 29 October 2006 (UTC)

 * I was poking around on Leonid Levin's page and noticed there is also an article titled Cook-Levin Theorem, which I think should also be merged into here. Note the capital "T" - currently Cook-Levin theorem (small "t") is a redirect, but the capital T page is not. I haven't checked out all of the differences yet, but I will try and move some over if I have time. --Culix 08:39, 10 December 2006 (UTC)

Yay. The theorems are the exact same, and the correct name of the Article should be the Cook-Levin theorem, because even though Cook discovered it first, Levin independently discovered it on the USSR front, and I think some credit should be given to him and to the discoveries he made in that part of the world. Can anyone edit this to make them look nice together??? Charlesblack 16:26, 16 December 2006 (UTC)

Support as per above. Either This article and Proof that Boolean satisfiability problem is NP-complete should both be merged into Cook-Levin Theorem, or Cook's theorem and Cook-Levin theorem should both be merged into Proof that Boolean satisfiability problem is NP-complete. "Cook's Theorem" is an unacceptable title as it does not give the theorem's creators equal merit for their work. However, the proof on this page is certainly the more concise one and should form the bulk of the future article's structure. Allispaul 12:28, 5 March 2007 (UTC)

Support. I think we should merge everything from Cook's theorem and Proof that Boolean satisfiability problem is NP-complete into Cook-Levin theorem, to give proper credit, and keep the most concise proof as the main bulk of the article. Cook-Levin theorem will have to be changed from a redirect into an actual page, and this page will have to be changed to a redirect. Cook-Levin Theorem (capital 'T') will have to be merged into Cook-Levin theorem (small 't') as well (and then turned into a redirect). --Culix 20:46, 7 March 2007 (UTC)

Strong oppose Cook was the first, and the theorem is known by his name all over the world. `'Míkka>t 21:01, 27 November 2007 (UTC)

Merge complete
I moved this article to Cook–Levin theorem and turned the other two articles into redirects. I decided not to merge any content: Proof that Boolean satisfiability problem is NP-complete had essentially the same proof presented here but in a slightly less systematic way, while Cook-Levin Theorem had a less direct proof. If someone cares enough about these alternative presentations of the proof then they can add them as extra sections. Gdr 13:40, 8 May 2007 (UTC)
 * Thanks Gdr, it looks great. --Culix 15:08, 19 June 2007 (UTC)

I agree with Culix, Charlesblack, Allispaul, and Gdr. In modern literature, the name Cook-Levin Theorem is only slightly more common than Cook's Theorem: see http://scholar.google.com/scholar?as_epq=%22Cook%27s+Theorem%22&as_ylo=2000 http://scholar.google.com/scholar?as_epq=%22Cook-Levin+Theorem%22&as_ylo=2000 http://www.claymath.org/millennium/P_vs_NP Still, it is more accurate and neutral, so the move to Cook-Levin Theorem was right. --Svnsvn 16:51, 2 November 2007 (UTC)
 * I agree that the proper name of the theorem is Cook-Levin theorem. Cook and Levin had basically no way of knowing that the other was developing the same idea. Also, both developed it in slightly different ways (Cook asked whether a solution exists; Levin asked what the solution was). Both are interesting and noteworthy.
 * Levin published only two years after Cook, which at that moment in mathematics, was simultaneous. I have seen a few other theorems or ideas commonly named after two people who developed it in "parallel", but who published many years apart. For example, I have been working on an article about Szasz-Mirakyan operators where the gap between Szasz' and Mirakjan's paper was 9 years. Again, this is "simultaneous" for the time period.
 * One cannot use Google Scholar to accurately search for the proper name of something unless you also run the search in Russian. Levin was Russian and his paper was seen by Russians. His name will probably need to be the Russian one in the search, too.
 * « D Trebbien ( talk ) 16:52 2008 January 4 (UTC)

Rename was reverted
User:Mikkalai moved the page back to Cook's theorem with no discussion here. I've undone that for the moment. Let's go over the arguments again. Gdr 12:59, 30 November 2007 (UTC)

User:Mikkalai moved the page (again!) to Cook-Levin theorem with no discussion here. (He or she moved it to CookLevin theorem first, which had the side-effect that a non-administrator would have been unable to move it back, but I prefer to hope that that was a mistake rather than deliberate obfuscation.) WP:MOSDASH says that the en-dash is to be preferred for linking names (cf. Michelson–Morley experiment, Knuth–Morris–Pratt algorithm etc). Again, if there's an argument, let's consider it. Gdr 15:08, 19 January 2008 (UTC)

Dtrebbien - the two statements are *exactly* equivalent!
Re the revert by User:Dtrebbien, it should be pointed out that "solvable by a nondeterministic Turing machine in polynomial time" is exactly equivalent to "verifiable by a deterministic Turing machine in polynomial time", and the proof is textbook material. In fact, as the article on NP (complexity) states: ''The two definitions of NP as the class of problems solvable by a nondeterministic Turing machine (TM) in polynomial time and the class of problems verifiable by a deterministic Turing machine in polynomial time are equivalent. The proof is described by many textbooks, for example Sipser's Introduction to the Theory of Computation, section 7.3.''

It is really a matter of personal preference whether one goes with "verifiable in polynomial time by a deterministic Turing machine" or "solvable in polynomial time by a nondeterministic Turing machine". However, keep in mind that the current statement in the article reads: SAT is intuitively in NP because a nondeterministic Turing machine can, in polynomial time, guess an assignment of truth values to the variables, determine the value of the expression under that assignment, and accept this if the assignment makes the entire expression true.[vague]. Many of my students have initially equated "nondeterministic Turing machine" to "guess-and-check", which leads to trouble since a guess-and-check approach for a difficult but satisfiable SAT instance in N variables should take an expected time around half of 2^N, with worst case around 2^N. My recommendation here would be to go with the "verifiable in polynomial time" statement for purposes of effective pedagogy, because it is intuitively obvious even for beginners that calculating the value of a Boolean expression with N variables and M gates should take no more time than evaluating each gate's result in sequence and storing the result. -- Brhaspati\talk/contribs 23:19, 6 April 2008 (UTC)

 * Based on the above reasons, I've reverted the revert, but kept both the definitions in the article. -- Brhaspati\talk/contribs 23:27, 6 April 2008 (UTC)

 * Hi Brhaspati,
 * I didn't like the idea of a non-deterministic Turing machine as "guess-and-checker", either, which is why vague was there in the first place.
 * Thanks for providing a reference for a proof that the two classes are equivalent, as it has been something that was alluded to in several sources, but which never seemed to be stated as a defining characteristic.
 * « D. Trebbien ( talk ) 04:42 2008 April 7 (UTC)

CNF

 * First you use De Morgan's laws to get the formula into conjunctive normal form

This isn't really accurate, since simply reducing a formula to CNF may cause an exponential increase in the size of the formula. We have to use a more sophisticated algorithm which (among other things) introduces new variables.--Taejo|대조 13:21, 23 June 2008 (UTC)

 * You are right. That sentence must be removed, and we need to replace it.  Does anyone have a quick reference? Since it's wrong it must be removed immediately, even if we don't find a replacement immediately.  Vegasprof (talk) 10:12, 31 October 2008 (UTC)

 * Sipser solves this by modifying the proof to create a formula that is already in CNF. Unfortunately, I don't have a copy of Sipser at hand for a reference, but it's fairly easy to do. It necessitates a bit of a rewrite, though. --Taejo|대조 10:35, 31 October 2008 (UTC)

 * I don't have access to the reference works at the moment, but it is my field, so I'll see what suggestions I can make. Let me introduce (original) notation.
 * Let me denote the problem as written by SAT.
 * Let me denote DSAT is the satisfiability problem for the conjunction of disjunctions of boolean variables and their negations. (I think this is the one actually used in the original source, but I'm not sure.)
 * Let me denote kSAT as the satisfiability problem for the conjunction of clauses, each of which has at most k boolean variables.
 * Let me denote kDSAT as the satisfiability problem for the conjunction of clauses, each of which is the disjunctions of at most k bookean variables and their negations. 3DSAT is what we now call 3SAT in the article.  (The duplication method noted toward the end makes it clear we can make this exactly k.)
 * Together with the obvious implications, kSAT can be reduced to kDSAT in 2k linear time by a brute force reduction of each clause to conjunctive normal form, and kDSAT can be reduced to 3DSAT by the introduction of structure variables, as described in the text. If we remove the disjunctions from the Turing machine simulation reduction table, where they don't belong, we can easily see that we've reduce any NP problem to 6SAT (and, with a little more effort, 4DSAT), and we're done.  Does this help? — Arthur Rubin  (talk) 16:20, 31 October 2008 (UTC)

 * I just looked at Sipser, which is the text I'm using for my course. Just as Taejo said, he proves directly that 3SAT is NP-complete, rather than by reducing SAT to it.  I guess there are two questions here. Should the Wikipedia page contain a proof that 3SAT is NP-complete, or just a hint as to how it's done (which is what it now contains, although it's the wrong hint)?  If a proof, which proof?  Personally, I like the proof by reduction of SAT to 3SAT better.  But in any case, I think we should remove the incorrect hint immediately.  Vegasprof (talk) 16:27, 31 October 2008 (UTC)

 * There's a subtle error in my "proof" in that the final satisfiability clause is a long disjunction, so the reduction is to (6+D)SAT, Nonetheless, it is possible to reduce SAT to 3SAT by "disassociating" (making all connectives binary connectives), and assigning a new boolean variable to each connective.  But we still need a reference.  — Arthur Rubin  (talk) 16:51, 31 October 2008 (UTC)

 * There's an explicit reduction from SAT to 3SAT in Beigel and Floyd, The Language of Machines: An Introduction to Computability and Formal Languages, Computer Science Press 1994, pp. 634–636. But a few pages earlier it defines SAT as only referring to CNF formulae. —David Eppstein (talk) 18:35, 31 October 2008 (UTC)

 * Since no one else has acted, I will modify the sentence as little as possible, using Sipser, to make it correct. We can decide later whether we should include an explicit polynomial time reduction of SAT to 3SAT.  Vegasprof (talk) 18:20, 1 November 2008 (UTC)

 * Strictly speaking, the following equivalence is false: (A ∨ B ∨ C ∨ D) ≡ (A ∨ B ∨ Z) ∧ (¬Z ∨ C ∨ D) since that means that the two formulae have the same truth value for every assignment of the 5 variables. What we need to say is that an assignment of the variables A, B, C, D satisfies the first expression if and only if that assignment can be extended to an assignment of A, B, C, D, Z which satisfies the second expression. Vegasprof (talk) 12:54, 3 November 2008 (UTC)
 * Since no one has objected, I will make that change. Vegasprof (talk) 17:32, 5 November 2008 (UTC)

Clause Conjunction Table
The row describing conjunction clauses needed for transitions (containing (Hik ∧ Qqk ∧ Tiσk) → (H(i+d)(k+1) ∧ Qq′(k+1) ∧ Tiσ′(k+1))) seems incomplete. Since we are using a non-deterministic Turing machine, we should have a separate clause for every (q, σ), each consisting of a disjunction of all expressions conforming to (q, σ, q′, σ′, d) ∈ δ.

That is, in a non-deterministic machine we may have multiple transitions which result in different actions (q′, σ′, d) corresponding to the same state/symbol pair (q, σ), and so must account for that possibility. If we don't account for this, we end up potentially requiring the machine to have multiple symbols in the same position on the tape at the same time (same problem for states and head position), which clearly violates the conditions enforced by prior clauses.

Does that sound correct? Any suggestions on how to modify the table concisely to reflect this? Perhaps I'm not thinking through it properly, but is it even correct to say that a non-deterministic Turing machine is only in one state at a time? Jjldj (talk) 04:16, 17 February 2009 (UTC)

 * The above-mentioned problem has been addressed with the addition of the disjunction to the formula. The proof still seems wrong to me, though:
 * Nothing ensures that there's at least one symbol per cell. Maximum of one symbol per cell *is* ensured, though.
 * Halting is not handled; halted machine can do anything.
 * The proof in Garey and Johnson does deal with these explicitly, but their presentation of the proof is sufficiently different that I'm unsure about how to fix this one. arcatan (talk) 17:46, 16 October 2014 (UTC)

The proof in Sipser's textbook (Thm.7.30, p.254-259) uses somewhat different notation. Translated to our article's notation, Sipser includes, for every 0≤i,k≤p(n), the formula Ti0k v ... v Tisk, where Σ={0,...,s}, for the first issue. For the second one, he changes "must finish in an accepting state" to "an accepting state must occur in some step", i.e. Vf ∈ F V0≤k≤p(n) Qfk. - Jochen Burghardt (talk) 22:40, 16 October 2014 (UTC)

I just implemented my above suggestions in the article; see line "At least one symbol per tape cell", and the last line. - Jochen Burghardt (talk) 17:55, 17 October 2014 (UTC)

Cook, Levin and Karp
There are three (not just two) different theorems about the "NP completeness" of SAT: Cook's version, Karp's version (which followed Cook) and Levin's version (which was independently found). Each of them uses different definitions, and therefore, they are not mathematically equivalent. Whether Cook's completeness notion and Karp's notion are equivalent is one of the major open problems in Complexity Theory. I cannot work on the article right now, but I thought it worthwhile to leave a note. AmirOnWiki (talk) 09:05, 5 October 2012 (UTC)

Known optimal algorithms?
"Additionally he found for each of these problems an algorithm that solves it in optimal time (in particular, these algorithms run in polynomial time if and only if P = NP)."

According to this statement the optimal algorithms have been found and by measuring their time complexity we can determine if P = NP. Surly something is wrong here. — Preceding unsigned comment added by Folket (talk • contribs) 14:44, 13 January 2015 (UTC)
 * The convergence of these algorithms running time to their asymptotic behavior is too slow to measure accurately, and anyway we need proofs not experiments. —David Eppstein (talk) 16:46, 13 January 2015 (UTC)

I'd like to see some of these algorithms. Maybe it's terribly naive, but I wonder why no sharp complexity bound could be proven for any of them up to now. However, I don't have access to a translation of Levin's paper; and e.g. Sipser's textbook doesn't mention such algorithms known to be optimal (unless I overlooked something, or these "algorithms" are just what we call reductions today). - Jochen Burghardt (talk) 19:48, 13 January 2015 (UTC)
 * Define a "searcher" to be a Turing machine with three tapes (input, witness, scratch) that halts if the witness tape ever holds a witness for the given NP-complete problem instance and does not halt otherwise. Then if the problem can be solved in polynomial time, there exists a searcher that solves it in polynomial time (for all positive instances, but fails to halt for negative instances). Additionally there exists a brute force searcher that ignores its input tape and just counts up in binary in the witness tape; this searcher solves all positive instances but will probably not take polynomial time. Then, to solve a given instance of length n, let f(n) be a sufficiently slowly growing function (log log n is probably good enough) and simulate, in parallel, the set of all possible searchers with at most f(n) states, including also the brute force searcher even if it has too many states. Keep running the simulation until one of the simulated searchers halts. Because of the inclusion of the brute force searcher, this algorithm will correctly halt on all yes instances and fail to halt on all no instances. If P≠NP, it will not take polynomial time (because nothing can). And if P=NP then there exists a polynomial time searcher that will be included in the parallel simulation for all large enough inputs and that will cause the whole algorithm to halt within polynomial time (because small instances don't count towards the asymptotic time bound and multiplying the time for the good searcher by the overhead for the parallel simulation of all the other searchers and for testing the witnesses at each step still gives a polynomial). Of course, this isn't a true polynomial time algorithm because it doesn't halt on the no-instances, and I haven't read Levin to find out whether and how he gets around this issue. —David Eppstein (talk) 20:25, 13 January 2015 (UTC)

Improved worst case number of clauses?
There is a paper here (https://www.cs.cmu.edu/~wklieber/papers/2007_efficient-cnf-encoding-for-selecting-1.pdf) that shows how to encode the "exactly one" constraint in O(n) clauses rather than O(n^2) clauses. The Cook–Levin reduction uses "exactly one" constraints multiple times. Does that mean the worst case is actually lower? Thanks

Complexity / Generalized versions
Could some expert please have a look at the 2nd paragraph in section Cook–Levin_theorem, and provide some more context there? I guess, the paragraph describes some proof constructions similar to Cook's (maybe using QBFs and/or DQBFs to establish a theorem about PSPACE-completeness?), but I'm unable to comprehend the sentence. Nevertheless, the two given references (the 2nd one available open-source) seem to indicate that the paragraph deals with something important, imo. - Jochen Burghardt (talk) 18:08, 7 May 2023 (UTC)

 * One way of stating the Cook–Levin theorem is that SAT can be used to encode nondeterministic polynomial time Turing machine computations. Another is that there exists an NP-complete problem, SAT.
 * This paragraph is merely pointing to the similarity of this with other similar formulations of other complexity classes (both easier and harder). In particular, QBF (which looks a lot like SAT but adds quantifiers to the variables) can be used to encode polynomial space Turing machine computations, so there exists a PSPACE-complete problem, QBF. I'm pretty the part about DQBF is for corresponding results for nondeterministic logarithmic space complexity, NL (complexity), but its wording appears garbled. —David Eppstein (talk) 20:05, 7 May 2023 (UTC)

Missing Expressions
I'm a little confused on why the table does not contain some other expressions.

In order to account for the fact that at any time $$k$$ there needs to be exactly one symbol per tape cell we have two expressions $$\neg T_{i, j, k} \lor \neg T_{i', j, k}$$ and $$\bigvee_{j \in \Sigma} T_{i, j, k}$$ for at most and at least one symbol per cell respectively. Since we have $$\neg Q_{q, k} \lor \neg Q_{q', k}$$ and $$\neg H_{i, k} \lor \neg H_{i', k}$$ for at most one state and head position, since we need to have exactly one state and head position at time $$k$$ why aren't the expressions $$\bigvee_{q \in Q} Q_{q, k}$$ and $$\bigvee_{-p(n) \le i \le p(n)} H_{i, k}$$ included to denote at least one state and head at time $$k$$?

Furthermore, how come our expression for checking only one head position $$\neg H_{i, k} \lor \neg H_{i', k}$$ takes $$O(n^3)$$? Aren't we just iterating through $$-p(n) \le i \le p(n)$$? CalMan2003 (talk) 01:34, 13 September 2023 (UTC)

 * I agree that $$\bigvee_{q \in Q} Q_{q, k}$$ and $$\bigvee_{-p(n) \le i \le p(n)} H_{i, k}$$ seem to be missing. Indeed, they are present in the source. ✅ I added them to the table now.
 * As for the complexity, we need one disjunction for every possible combination of $$i,i',k$$, and there are $$O(p(n)^3)$$ of them. - Jochen Burghardt (talk) 08:22, 13 September 2023 (UTC)

title: Talk:Cook–Levin theorem


text:
Kurt Zeitzler

Kurt Zeitzler (9 June 1895 – 25 September 1963) was a Chief of the Army General Staff in the Wehrmacht of Nazi Germany during World War II.

Zeitzler was almost exclusively a staff officer, serving as chief of staff in a corps, army, and army group. In September 1942, he was selected by Adolf Hitler as Chief of the Army General Staff, replacing Franz Halder. In early 1943 he was one of the key figures in the decision to launch Operation Citadel, the last major German attack on the Eastern Front, which ended in defeat. Zeitzler lost faith in Hitler's judgement, and abandoned his position in July 1944 after suffering a nervous breakdown. Zeitzler was regarded as an energetic and efficient staff officer, noted for his ability in managing the movement of large mobile formations.

World War I and interwar period
Born in Goßmar in the Province of Brandenburg, Zeitzler came from a family of pastors. At the age of 18 he joined the 4th Thuringian Infantry Regiment of the German Army on 23 March 1914. Five months later Germany was at war. Zeitzler was promoted to lieutenant in December 1914, and commanded various units, including a pioneer detachment. At the end of the war he was a regimental adjutant.

Zeitzler was chosen as one of the 4,000 officers selected to serve in the Reichswehr, the small German army permitted under the limits of the Treaty of Versailles. He was promoted to captain in January 1928. In 1929 he began three years of service as a staff officer of the 3rd Division. In February 1934 he was transferred to the Reichswehrministerium ("Defense Ministry" of the Weimar Republic) and promoted to major. In 1937 he became a staff officer in the operations office for the Oberkommando des Heeres (OKH), the headquarters of the German Army. In April 1939 he took command of Infantry Regiment 60, and was promoted to full colonel in June.

World War II
During the invasion of Poland in September 1939, Zeitzler was chief of staff to General Wilhelm List, commanding the XXII (Motorized) Corps in the 14th Army. In March 1940 he became chief of staff to General von Kleist, commanding Panzergruppe A, later redesignated 1st Panzer Army. During the Battle of France, Zeitzler brilliantly organized and managed the panzer drive through the Ardennes. He continued in this post through the successful invasion of Yugoslavia and Battle of Greece. On 18 May 1941 Zeitzler was awarded the Knight's Cross of the Iron Cross.

His greatest success came during Operation Barbarossa, the 1941 invasion of the Soviet Union. During the first two months of Barbarossa, 1st Panzer Army plunged east into Soviet territory, then moved south to the Black Sea to cut off Soviet forces in the Battle of Uman, then north to encircle Soviet forces around Kiev, then south again across the Dnieper River, and then further south to cut off Soviet forces near the Sea of Azov. Through all this strenuous campaigning, Zeitzler kept 1st Panzer Army moving smoothly and ensured that supplies arrived. In appreciation of Zeitzler, Kleist commented "The biggest problem in throwing about armies in this way was that of maintaining supplies."

In January 1942, Zeitzler was made chief of staff to General Gerd von Rundstedt, OB West (Commander in Chief West) and commander of Army Group D. He played an important role in responding to the Canadian raid on Dieppe on 19 August 1942.

Chief of Staff, OKH
On 24 September 1942 Zeitzler was promoted to General der Infanterie ("General of the Infantry") and simultaneously appointed Chief of the OKH General Staff, replacing Franz Halder. Hitler had been impressed by Zeitzler's optimistic and vigorous reports, and chose him over several higher-ranked and more senior officers. Albert Speer states Hitler wanted a reliable assistant who "doesn't go off and brood on my orders, but energetically sees to carrying them out."

Following Zeitzler's promotion, Hitler was initially impressed with his dedication to his task and fighting spirit. In November 1942, Soviet counterattacks surrounded the German Sixth Army in Stalingrad. Zeitzler recommended that Sixth Army immediately break out and withdraw from Stalingrad to the Don bend, where the broken front could be restored. Hitler instead became enraged, overruled Zeitzler, and personally ordered the Sixth Army to stand fast around Stalingrad, where it was destroyed.

During early 1943 Zeitzler developed the initial plans for Operation Citadel, the final major German offensive in the east, and convinced Hitler to undertake the offensive despite the objections raised by several other senior officers. This battle ended in a strategic defeat for the Germans, and a series of defensive battles ensued.

Zeitzler's relationship with Hitler deteriorated during 1944. Hitler blamed him for the German defeat in the Crimea during April and May. This caused Zeitzler to signal his desire to resign. By the middle of the year Zeitzler had lost all faith in Hitler's tactics as a result of the deteriorating situation in Western Europe after the Allied landing at Normandy and Hitler's refusal to allow Army Group Centre to withdraw to more defensible positions on the Eastern Front. On 1 July Zeitzler suffered a nervous breakdown, and fled Hitler's Berghof residence. Hitler never spoke to him again, and had him dismissed from the Army in January 1945, refusing him the right to wear a uniform.

Postwar life
At the end of the war, Zeitzler was captured by British troops. He was a prisoner of war until the end of February 1947. He appeared as a witness for the defense during the Nuremberg trials, and worked with the Operational History Section (German) of the Historical Division of the U.S. Army.

Zeitzler died of lung cancer in 1963 in Hohenaschau in Upper Bavaria.

Awards

 * Knight's Cross of the Iron Cross on 18 May 1941 as Oberst i.G. and Chef des Generalstabes Panzer-Gruppe 1

title: Kurt Zeitzler


text:
Strigiphilus garylarsoni

Strigiphilus garylarsoni is a species of chewing louse found only on owls. The species has no common name.

The species was first described by biologist Dale H. Clayton in 1990, who named it after cartoonist Gary Larson.

Host
Its type host is the Northern white-faced owl (Ptilopsis leucotis).

Distribution
The type location is Ndola, Zambia.

Etymology
It was named after Gary Larson, creator of the syndicated cartoon The Far Side. In a letter to Larson, Clayton praised the cartoonist for "the enormous contribution that my colleagues and I feel you have made to biology through your cartoons." In his 1989 book The Prehistory of the Far Side, Larson stated, "I considered this an extreme honor. Besides, I knew no one was going to write and ask to name a new species of swan after me. You have to grab these opportunities when they come along." Clayton wrote he honored Larson "in appreciation of the unique light he has shed on the workings of nature."

title: Strigiphilus garylarsoni


text:
Talk:65th Infantry Division (United States)

Per WikiProject Military, we want the "US" on the front by default. Both the WWII Germans and Soviets had 65th divisions, so country-less division numbers are always going to have to be disambiguators. Stan 21:02, 21 Jul 2004 (UTC)


text:
Churches of Christ Uniting

Churches of Christ Uniting was a proposed name for a body growing out of the Consultation on Church Union which began in 1962 among ten predominantly "mainline" U.S. Protestant denominations. The consolidation proposed in the original scheme was overwhelmingly rejected when put to a vote of the constituent denominations in 1969, so the leaders, unwilling to abandon totally this effort, adopted more of a "go slow" approach. Groups within the Consultation began closer contacts, and in some instances full communion, with each other, and the idea to call the group that was hoped to be formed in the long term Church of Christ United was proposed, with the interim name while the process was ongoing to be Church of Christ Uniting. (These names had the additional advantage of having the same initials as the initial Consultation on the Church Union.)

Opposition within the component denominations, particularly the United Presbyterian Church, caused any plan for a full merger to be put on hold, and a new name, seemingly implying that "uniting" is a presently-ongoing but perhaps long-term goal, was adopted, Churches Uniting in Christ. (This name also had the advantage of not sounding as much like one of the existing constituent groups, the United Church of Christ, nor like an entirely unrelated one, the Church of Christ.)

title: Churches of Christ Uniting


text:
Perfect Day (Lou Reed song)

"Perfect Day" is a song written by American musician Lou Reed in 1972. It was originally featured on Transformer, Reed's second post-Velvet Underground solo album, and as B-side of his major hit, "Walk on the Wild Side". Its fame was given a boost in the 1990s when it was featured in the 1996 film Trainspotting and after a star-studded version was released as a BBC charity single in 1997, reaching number one in the United Kingdom, Ireland, and Norway. Reed re-recorded the song for his 2003 album The Raven.

Recording and composition
The original recording, as with the rest of the Transformer album, was produced by David Bowie and Mick Ronson (who also wrote the string arrangement and played piano on the track). The song has a sombre vocal delivery and a slow, piano-based instrumental backing.

The song was written after Reed and his then fiancée (later his first wife), Bettye Kronstad, spent a day in Central Park. The lyric is often considered to suggest simple, conventional romantic devotion, possibly alluding to Reed's relationship with Kronstad and Reed's own conflicts with his sexuality, drug use and ego.

Some commentators have further seen the lyrical subtext as displaying Reed's romanticized attitude towards a period of his own addiction to heroin. This popular understanding of the song as an ode to addiction led to its inclusion in the soundtrack for Trainspotting, a film about the lives of heroin addicts. However, this interpretation, according to Reed himself, is "laughable". In an interview in 2000, Reed stated, "No. You're talking to the writer, the person who wrote it. No that's not true. I don't object to that, particularly...whatever you think is perfect. But this guy's vision of a perfect day was the girl, sangria in the park, and then you go home; a perfect day, real simple. I meant just what I said."

In other media
The song has featured in commercials such as an AT&T advertisement which ran during the 2010 Olympics, and an advertisement by Sony for the launch of the PlayStation 4 in October 2013, two weeks before Reed's death. The song has also appeared in TV shows including Fear the Walking Dead, the season one finale of The Mist, Doom Patrol, and Our Flag Means Death. In 2015, the song appeared as ironic counterpoint to the main character's demotion in the season 2 premiere of the TV series Gotham. The song was also featured in the 2020 TV series, Brave New World, based on the book by Aldous Huxley.

In 2020, the song was performed by a choir of past and present cast members of Saturday Night Live on the show's April 11 episode as a tribute to the show's longtime music producer Hal Willner, following his death from COVID-19 earlier in the week. In 2021, a cover version by Scala & Kolacny Brothers was used in the trailer for the 2021 film Spencer.

An orchestral version of the song by composer Ramin Djawadi was featured on the 5th episode on season 4 of Westworld. The original version is also used in the teaser trailer.

The song is featured in the 2023 film Perfect Days by Wim Wenders.

Personnel

 * Lou Reed – vocals
 * Mick Ronson – piano, string arrangements
 * David Bowie – keyboards
 * Trevor Bolder – trumpet
 * Herbie Flowers – tuba
 * Klaus Voormann – bass
 * John Halsey – drums

Live performances and cover versions
In the 1980s, Heaven 17 covered this song on their third B.E.F. album, and the early Human League performed it live numerous times, but the first significant cover came in the 1990s.

Duran Duran version
A cover version of "Perfect Day" was the first single from the Duran Duran covers album Thank You. It was released in the United Kingdom on March 13, 1995, and reached number 28 on the UK Singles Chart the same month. The cover was also released to US radio on May 23, 1995.

The song featured a then rare appearance by Duran Duran's first drummer Roger Taylor. He also appeared in the music video and in a promotional appearance on Top of the Pops. The video was filmed in February 1995 by director Nick Egan, and first aired in March. It shows clips of the band performing, interspersed with surreal images.

The single was released in several versions, including numerous different remixes of the title track and other Duran Duran songs. In addition to the single and the Thank You album, the song also appeared in Duran Duran's Singles 1986–1995 box set, released in 2004. On Duran Duran's episode of Behind the Music, Reed described the Duran Duran version as being potentially the best rerecording of any of his songs.

Kirsty MacColl and Evan Dando version
In 1994, British singer-songwriter Kirsty MacColl and American musician Evan Dando recorded the song as a duet. It was included as one of two new tracks on MacColl's 1995 compilation album Galore and reached number 75 in the UK Singles Chart when released as a single on June 12, 1995.

MacColl has described the song as "glorious and tragic at the same time". Speaking of her collaboration with Dando, she told Steve Harris in 1995: "I met Evan a couple of years ago and we sort of talked about possibly doing something together. When I was recording the new tracks for [Galore], I thought "Perfect Day" would be a really good song to do as a duet [and that] he would be the ideal person to sing it with me." MacColl was initially unsure of how to contact Dando, but decided to record the backing track in anticipation of being able to add his contribution at a later date. By coincidence, Dando phoned MacColl two days after the backing track was recorded to let her know he was performing in London with his band The Lemonheads and he agreed to provide vocals on the track while in the UK. In 2022, Dando recalled to Stereogum that collaborating with MacColl was "great" and "really fun".

Music Week described "Perfect Day" as a "hugely sentimental ballad" with Dando "shockingly in deep-voiced crooner mode". Nick Marshall of the Hull Daily Mail considered the version to be "very moody" and remarked about Dando's vocals, "If you think Bob Geldof has attitude, listen to Dando." He felt that MacColl "fits well into this serene ballad, but battles in sharp contrast to her spritely lyrics she has become renowned for". Caitlin Moran of the Irish Independent praised it as "a languorous version" on which MacColl and Dando duet "beautifully". Anthony Barnes of the Sunderland Echo called it a "faithful rendition in the wake of the dreadful Duran Duran version" and a "perfect pairing of vocal talents for this sombre classic". Jennifer Nine of Melody Maker was critical of what she felt was a 'pablum-smooth rendition", in which "every last bit of menace, irony and life has been sucked out" and MacColl and Dando sound "Prozac-ed into a coma".

BBC corporate film and charity release
In 1997, the BBC made a version of the song in a lengthy corporate promotion of its diverse music coverage which was broadcast on BBC channels, in cinemas, and at major events organised by the BBC such as the Eurovision Song Contest 1998. It featured Lou Reed himself and other major artists in what the Financial Times described as "an astonishing line-up of world class performers". In reference to the licence fee, the film ends with the message "Whatever your musical taste, it is catered for by BBC Radio and Television. This is only possible thanks to the unique way the BBC is paid for by you. BBC. You make it what it is." This message appears over the repeated words "You're going to reap just what you sow" which The Guardian described as "a none too subtle message: keep writing the cheque." In response to accusations from commercial competitors that the corporation had wasted vast sums on the film it was revealed that each artist received a "token" £250, which was at the time the minimum pay for a performance on BBC.

Prompted by huge public demand, the track was released on November 17, 1997, as a charity single for Children in Need, and Reed commented, "I have never been more impressed with a performance of one of my songs." It was the UK's number one single for three weeks, in two separate spells. The record contributed £2,125,000 to the charity's highest fundraising total in six years, and, as of November 2016, has sold 1.54 million copies. The release featured two additional versions of the song: one entirely sung by female performers, one by male performers. The BBC also produced a Christmas version of the accompanying music video.

In Ireland, the song was a huge success, remaining at number one for seven weeks and becoming 1997's Christmas number one. The single also topped the Norwegian Singles Chart for seven weeks in late 1997 and early 1998, spending 17 weeks on the chart in total. Elsewhere in Europe, it reached number four in Finland, number six in the Netherlands, number seven in Flemish Belgium and number 10 in Iceland. It was also a top-thirty hit in Austria, New Zealand and Walloon Belgium.

The song has not been digitally released to digital music platforms as the "single [is] unusable again in a commercial context due to the specific nature of the clearances for Children In Need at the time".

Performers
Performers in order of appearance; parentheses indicate instrumental or vocalisation appearances, and dividers indicate verses/sections.

 * Lou Reed
 * Bono
 * Skye Edwards (from Morcheeba)

 * David Bowie
 * Suzanne Vega
 * Elton John
 * (Andrew Davis)

 * Boyzone
 * Lesley Garrett
 * (Lou Reed)
 * Burning Spear
 * Bono
 * Thomas Allen
 * (Brodsky Quartet)

 * Heather Small (from M People)
 * Emmylou Harris
 * Tammy Wynette
 * Shane MacGowan
 * (Sheona White) (tenor horn player)

 * Dr. John
 * David Bowie
 * Robert Cray
 * Huey Morgan (from Fun Lovin' Criminals)

 * Ian Broudie (from The Lightning Seeds)
 * Gabrielle
 * Dr. John
 * Evan Dando (from the Lemonheads)
 * Emmylou Harris

 * (Courtney Pine) (soprano saxophone player)
 * (BBC Symphony Orchestra)
 * (Andrew Davis)
 * (Bono)

 * Brett Anderson (from Suede)
 * Visual Ministry Choir
 * Joan Armatrading
 * Laurie Anderson
 * Heather Small
 * Tom Jones
 * Heather Small
 * Lou Reed

Critical reception
Alan Jones from Music Week said the song is "a rare example of a charity record which actually sounds good in its own right."

Sequels
Following the success of the "Perfect Day" music video, the BBC produced three further similar campaigns. The first, Future Generations, in December 1998, did a similar multi-celebrity montage with favourite BBC children's programmes. The second, called Shaggy Dog Story, featured various comedians and comic actors telling a long-winded shaggy dog story, with each one sharing a line or phrase. A second, shorter shaggy dog story, entitled Mammals vs. Insects, was also broadcast on January 4, 2000. Seventeen years after "Perfect Day"'s release, the BBC produced a campaign for their new music division where 27 musicians (labelled "The Impossible Orchestra") covered the Beach Boys' "God Only Knows". The only person to appear in both campaigns is Sir Elton John.

The cover was parodied on a 1997 special Harry Enfield and Chums, as well as by Matt Lucas and David Walliams.

The single inspired Sony Music to release a various artists compilation album, Perfect Day, in early 1998. It reached number 7 in the UK Compilation Chart. It featured Reed's original version of the song instead of the Various Artists version.

Music Live 2000
A BBC live television event in 2000, which consisted of music programs around the clock, ended in another round-robin performance of "Perfect Day". Although watched by millions, the recording of the show that was released as a single was not a chart success, reaching only number 69 in mid-June 2000.

This line-up included Rolf Harris and a beginning and ending performance from Lou Reed himself.

Susan Boyle version
Scottish recording artist Susan Boyle covered the song on her second album The Gift and also released it on November 8, 2010, as a single.

On November 19, 2010, she performed the song on Children in Need. She also performed this again at the 82nd Royal Variety Performance, performed on the December 9, 2010.

Conflict with Lou Reed
In September 2010, Susan Boyle had to cancel a performance on America's Got Talent at the last minute. She had planned to sing "Perfect Day", but two hours before the show, she was told that Lou Reed had intervened, refusing her permission to perform his song and to include it on her forthcoming album The Gift. As she and her choir did not have time to rehearse another number, she decided to cancel her performance. A couple of days later, representatives of Reed stated that he had nothing to do with the decision and that it was just a licensing glitch.

A couple of weeks later, Reed agreed not only to let her include the song on The Gift, but also to produce her music video of the song. It was shot on the banks of Loch Lomond and premiered on November 7, 2010.

Vatican tweet
Soon after Reed's death in 2013, Cardinal Gianfranco Ravasi, the Vatican's culture minister, made news by tweeting lyrics from the song: Oh, it's such a perfect day I'm glad I spent it with you Oh, such a perfect day You just keep me hanging on

As the song is widely interpreted by listeners to be drug-related, the cardinal later clarified that he did not condone drug use.

title: Perfect Day (Lou Reed song)


text:
Aruban Liberal Organization

The Aruban Liberal Organization (Organisacion Liberal Arubiano, OLA) is a liberal political party in Aruba. At the last elections for the Estates, 28 September 2001, the party won 5.7% of popular votes and one out of 21 seats. On 23 September 2005, the party won only 4% of the popular vote and lost its seat.

title: Aruban Liberal Organization


text:
Talk:Chysauster Ancient Village

Comments
How does filling in a fogou under archaeological supervision to preserve it and stop it from caving in on the public constitute negligent damage? The article implies that the entire village was destroyed by evil government agencies. It is still open to the public. The fogou was covered because it was dangerous- sure, this is not a strong argument and yes it could have been rebuilt using different materials but then it would have been a different site. adamsan

Controversy over the site
Why was this text removed ? - please discuss before removing further text.

In 1999 there was some controversy regarding this site and others under the care of the English Heritage organisation. The Cornish Stannary Parliament wrote to English Heritage asking them to remove all signs bearing their name from Cornish sites by July 1999 as they regard the ancient sites as Cornish heritage, not English. Over eleven months eighteen signs were removed by members of the Cornish Stannary and a letter was sent to English Heritage saying "The signs have been confiscated and held as evidence of English cultural aggression in Cornwall. Such racially motivated signs are deeply offensive and cause distress to many Cornish people". (see external BBC link). *Cornish Stannary Parliament tackles cultural aggression in Cornwall *BBC news - Historic signs case trio bound over

The bias of this paragraph is currently being discussed at Talk:Tintagel Castle Putney Bridge 23:18, 15 February 2007 (UTC)

Hello, I am currently researching weaknesses in the statutory system for ancient monuments in Cornwall, and I expected to see something on the controversy at the Chysauster page, and the well known issue of damage to the fogou. Looking closer I can see that this has been removed from the page. Will this be put back? It seems odd that Wikipedia has omitted this. Information on this topic is available elsewhere in paper published form, and online in newspaper articles. Thank you. Artowalos (talk) 10:50, 23 June 2021 (UTC)Artowalos

Roman site
Although the site was in existence throughout the Roman period, it was inhabited by the Celtic tribe, not the Romans. Should it have the "Romans in Cornwall" category? MortimerCat 06:34, 2 October 2007 (UTC)
 * No. I've removed it now.  Ghmyrtle (talk) 09:48, 17 June 2009 (UTC)

title: Talk:Chysauster Ancient Village


text:
Quad flat package

A quad flat package (QFP) is a surface-mounted integrated circuit package with "gull wing" leads extending from each of the four sides. Socketing such packages is rare and through-hole mounting is not possible. Versions ranging from 32 to 304 pins with a pitch ranging from 0.4 to 1.0 mm are common. Other special variants include low-profile QFP (LQFP) and thin QFP (TQFP).

The QFP component package type became common in Europe and United States during the early nineties, even though it has been used in Japanese consumer electronics since the seventies. It is often mixed with hole mounted, and sometimes socketed, components on the same printed circuit board (PCB).

A package related to QFP is plastic leaded chip carrier (PLCC) which is similar but has pins with larger pitch, 1.27 mm (or 1/20 inch), curved up underneath a thicker body to simplify socketing (soldering is also possible). It is commonly used for NOR flash memories and other programmable components.

Limitations
The quad flat-pack has connections only around the periphery of the package. To increase the number of pins, the spacing was decreased from 50 mil (as found on small outline packages) to 20 and later 12 (1.27 mm, 0.51 mm and 0.30 mm respectively). However, this close lead spacing made solder bridges more likely and put higher demands on the soldering process and alignment of parts during assembly. The later pin grid array (PGA) and ball grid array (BGA) packages, by allowing connections to be made over the area of the package and not just around the edges, allowed for higher pin counts with similar package sizes, and reduced the problems with close lead spacing.

Variants
The basic form is a flat rectangular (often square) body with leads on four sides but with numerous variation in the design. These differ usually only in lead number, pitch, dimensions, and materials used (usually to improve thermal characteristics). A clear variation is bumpered quad flat package (BQFP) with extensions at the four corners to protect the leads against mechanical damage before the unit is soldered.

Heat sink quad flat package, heatsink very thin quad flat-pack no-leads (HVQFN) is a package with no component leads extending from the IC. Pads are spaced along the sides of the IC with an exposed die that can be used as ground. Spacing between pins can vary.

A thin quad flat pack (TQFP) provides the same benefits as the metric QFP, but is thinner. Regular QFP are 2.0 to 3.8 mm thick depending on size. TQFP packages range from 32 pins with a 0.8 mm lead pitch, in a package 5 mm by 5 mm by 1 mm thick, to 256 pins, 28 mm square, 1.4 mm thick and a lead pitch of 0.4 mm.

TQFPs help solve issues such as increasing board density, die shrink programs, thin end-product profile and portability. Lead counts range from 32 to 176. Body sizes range from 5 mm × 5 mm to 20 × 20 mm. Copper lead-frames are used in TQFPs. Lead pitches available for TQFPs are 0.4 mm, 0.5 mm, 0.65 mm, 0.8 mm, and 1.0 mm. PQFP, or plastic quad flat pack, is a type of QFP, as is the thinner TQFP package. PQFP packages can vary in thickness from 2.0 mm to 3.8 mm. A low-profile quad flat package (LQFP) is a surface mount integrated circuit package format with component leads extending from each of the four sides. Pins are numbered counter-clockwise from the index dot. Spacing between pins can vary; common spacings are 0.4, 0.5, 0.65 and 0.80 mm intervals.

Some QFP packages have an exposed pad. The exposed pad is an extra pad underneath or on top of the QFP that may act as a ground connection and/or as a heat sink for the package. The pad is typically 10 or more mm2, and with the pad soldered down onto the ground plane, heat is passed into the PCB. This exposed pad also gives a solid ground connection. These type of QFP packages often have a -EP suffix (e.g. a LQFP-EP 64), or they have an odd number of leads, (e.g. a TQFP-101).

Ceramic QFP package
Ceramic QFP packages come in two variants, CERQUAD and CQFP:

CERQUAD packages
Hereby the leadframe is attached between two ceramic layers of the package. The leadframe is attached using glass. This package is a variant of the CERDIP package. CERQUAD packages are the "low cost" alternative for CQFP packages, and are mainly used for terrestrial applications. Main ceramic package manufacturers are Kyocera, NTK,... and offer the full pincount range

CQFP packages
Hereby the leads are soldered on top of the package. The package is a multilayer package, and is offered as HTCC (high temperature co-fired ceramic). The number of bonding decks can be one, two or three. Package is finished with a nickel plus a thick gold layer, except where the leads are soldered and decoupling capacitors are soldered on top of the package. These packages are hermetic. Two methods are used in order to make the hermetic sealing: eutectic gold-tin alloy (melting point 280°C) or seam welding. Seam welding gives rise to significantly less temperature rise in the internal of the package (e.g., the die attach). This package is the main package used for Space projects.

Due to the large body size of CQFP packages, parasitics are important for this package. Power supply decoupling is improved by having the decoupling capacitors mounted on top of this package. E.g. TI offers 256-pin CQFP packages where decoupling capacitors can be soldered on top of the package E.g. Test-expert 256-pin CQFP packages where decoupling capacitors can be soldered on top of the package.

The main ceramic package manufacturers are Kyocera (Japan), NTK (Japan), Test-Expert (Russia), etc. and offer the full pincount range. Maximum pin count is 352 pins.

title: Quad flat package


text: Category:Elections in Aruba

title: Category:Elections in Aruba


text:
Talk:Tidal power

External links modified
Hello fellow Wikipedians,

I have just modified 9 external links on Tidal power. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:
 * Added archive https://web.archive.org/web/20121122141719/http://digitallibrary.usc.edu/assetserver/controller/item/etd-Chang-20080312.pdf to http://digitallibrary.usc.edu/assetserver/controller/item/etd-Chang-20080312.pdf
 * Added archive https://web.archive.org/web/20110719135526/http://www.newsworld.co.kr/cont/article2009/0909-52.htm to http://www.newsworld.co.kr/cont/article2009/0909-52.htm
 * Added archive https://web.archive.org/web/20110612022820/http://www.nspower.ca/en/home/environment/renewableenergy/tidal/annapolis.aspx to http://www.nspower.ca/en/home/environment/renewableenergy/tidal/annapolis.aspx
 * Added tag to http://www.cleancurrent.com/media/index.htm
 * Corrected formatting/usage for http://ecoseed.org/en/general-green-news/green-politics/green-policies/asia-pacific/3457
 * Added archive http://arquivo.pt/wayback/20160515075614/http://tethys.pnnl.gov/wiki/index.php/Tethys_Home to http://tethys.pnnl.gov/wiki/index.php/Tethys_Home
 * Added archive https://web.archive.org/web/20141110143850/http://www.racerocks.ca/wp/tag/tidal-energy/ to http://www.racerocks.ca/wp/tag/tidal-energy/
 * Added archive http://arquivo.pt/wayback/20160515075614/http://tethys.pnnl.gov/wiki/index.php/Tethys_Home to http://tethys.pnnl.gov/wiki/index.php/Tethys_Home
 * Added archive https://web.archive.org/web/20110723014221/http://www.severnestuary.net/sep/resource.html to http://www.severnestuary.net/sep/resource.html
 * Corrected formatting/usage for http://www.worldenergy.org/publications/survey_of_energy_resources_2007/tidal_energy/754.asp

When you have finished reviewing my changes, you may follow the instructions on the template below to fix any issues with the URLs.

Cheers.— InternetArchiveBot  (Report bug) 21:49, 3 September 2017 (UTC)

Note
Tidal power should affect the rotation of the Earth. I think that the effect is too small to be perceptible. — Preceding unsigned comment added by 83.216.95.91 (talk) 12:23, 13 January 2018 (UTC)
 * This is already mentioned in the article, but with no numerical estimates. — Preceding unsigned comment added by 83.216.95.91 (talk) 12:29, 13 January 2018 (UTC)
 * See https://physics.stackexchange.com/questions/6400/are-tidal-power-plants-slowing-down-earths-rotation
 * Admittedly, this is a blog. — Preceding unsigned comment added by 83.216.95.91 (talk) 14:05, 13 January 2018 (UTC)

External links modified (January 2018)
Hello fellow Wikipedians,

I have just modified one external link on Tidal power. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:
 * Added archive https://web.archive.org/web/20141110142522/http://racerocks.ca/energy/tidalremove/tidalremove.htm to http://racerocks.ca/energy/tidalremove/tidalremove.htm

When you have finished reviewing my changes, you may follow the instructions on the template below to fix any issues with the URLs.

Cheers.— InternetArchiveBot  (Report bug) 07:48, 22 January 2018 (UTC)

Port Berth Tidal Power Generator
There has been research and conceptual studies done in regards to closed loop hydraulic systems activated by the tidal lift and fall of extremely heavy ships in long term berthing. A second type of Port Berth Generator is based on the rise and fall of Cargo Ships being loaded and unloaded. The first system is utilized any where on earth with Tidal activity. The second system is basically for Container Ports where the rise and fall is in excess of 18ft 5.5 meters. This work has been done with the calculations of the USS United States in its Philadelphia Berth Tide conditions for the smaller tidal only system.Cpwieser (talk) 02:31, 8 March 2021 (UTC)< cpwieser personal research and calculations> The potential alternative energy generated from Port Berth systems can be used for Pumped Hydro Power, Compressed Air Storage, and Electricity. Reprint from thehkera.org;HK Era notes; 7-3-2018  Port Generator / Berth Vertical Actuator/ Overview We have a vertical motion in place which has huge potential. Imagine having a 110,000 ton weight moving up and down vertically 72” every six hours. Sheer weight and Gravity are the motivating forces in the down motion of the system, floatation and buoyancy are the factors affecting the system in the up motion of the system. In this overview we are considering the actual energy generation from a hydraulic closed loop system. This hydraulic system will be actuated by a mechanical force acting on a hydraulic cylinder which will then transfer hydraulic fluid through a hydraulic motor driving a PM generator. There is a vast amount of energy available to act on this closed loop system. The force on the system is equal in both directions of movement, both directions transferring a vast amount of energy into the hydraulic system. Since a very early age watching the vertical change in Tides has intrigued me. The Chesapeake and its tidal tributaries provided me with a first hand analysis from age 10 through 25. Visiting the Baltimore Harbor in the late 1960’s it was an awe inspiring thing to realize that all 26 huge freight carrying Ships, Barges, and Vessels, millions of tons of steel and cargo were being lifted 5 ½ ft vertically in about 6 hours! For Free. Just think for a second how large of a crane at what incredible cost it would take to just lift two ships up vertically 5 ft??? I think we need to design a Shipping port located Generator that is potentially capable of generating an endless supply of energy at no fuel cost what so ever. Imagine a machine about the size of a long shipping trailer attached to the bottom of the sea in every berth location in any or every port in the world. This machine would have a long horizontal beam with a latch hook or electro magnets to attach to the bottom of any ship in berth. Ships located in long term storage in Tidal situations could be an endless source of energy. This long beam attached to the bottom of the ship is then subject to every movement both up and down of the ship itself. This beam is attached to a very large series of Hydraulic Cylinders which then subject to movement, transfer fluid through a low pressure hydraulic system of which it is easy to yield energy. A control room situated on Port Property adjacent to the harbor could monitor a generator beneath each berthing location. The monitor would coordinate the generator functions. The timing of rise and fall of tides, scheduled with the loading and unloading of cargo will optimize the energy yield. Vertical movement of the ship yields energy in either direction, both up and down. Keep in mind a typical ship displaces from several hundred tons to several thousand tons!! In consideration of this type of generating system it is easy to imagine the vast amount of energy available for capture during the loading and unloading of cargo. During the loading of a huge Container ship this vertical movement could be as much as 30 ft or more during both loading and unloading. Revised and amended 7-4-2018 Cpwieser (talk) 02:36, 8 March 2021 (UTC)

Wiki Education assignment: Research Process and Methodology - FA22 - Sect 201 - Thu
— Assignment last updated by Ruizhouruizhou (talk) 13:39, 5 December 2022 (UTC)

Most Life On Earth Could be Wiped Out
A paper was published by Stanford University https://cs.stanford.edu/people/zjl/tide.html called " Tidal Energy Is Not Renewable" and claims "most life on Earth could be wiped out". Those are very strong words coming from the world's most prestigious university. Shouldn't the article make note of this? Jartine (talk) 15:41, 5 September 2023 (UTC)

 * Given the extreme claims, caution is required in citing it. Are you or I competent in judging that paper? No. Has it been submitted to an independent scientific journal for publication? This would involve peer-review by other experts in the field. If it has been published in a reputable independent publication, then it is worth noting. If it gets published but there are other experts who disagree, then the publication would bring responses that could be referenced. Thus presenting a neutral POV of the current state of knowledge. ToolmakerSteve (talk) 23:04, 11 November 2023 (UTC)
 * False. The natural tides already slow down the earth’s rotation. “The
 * natural rotational energy loss is roughly 3 TW (Shepherd, 2003). Thanks to
 * natural tidal friction, each century, the day gets longer by 2.3 milliseconds.
 * Many tidal energy extraction systems are just extracting energy that would
 * have been lost anyway in friction. But even if we doubled the power ex-
 * tracted from the earth–moon system, tidal energy would still last more
 * than a billion years.” ToolmakerSteve (talk) 23:36, 11 November 2023 (UTC)

title: Talk:Tidal power


text:
User talk:Topbanana/Reports/This page contains a link that might have an extra or missing space

I think I've got as far as I can with this report. Thanks, TB, it's been fun (mostly), and thanks for your kind words on my talk page last month that I never replied to.

I would like to say that I am not proud of the things I have done to List of Game Boy games, but that page is in a dreadful state anyway and I never had a Game Boy, so what do I know about it? Maybe I should have left more of those links alone, but I was determined to get right through this report and the red mist descended...

If anyone wants to write articles to fill some of the gaps that have been shown up that would be lovely, but I have other articles that I want to work on at the moment, and I don't know anything about most of the subjects involved anyway.

Thank you and good night. --rbrwrˆ 21:08, 21 Jul 2004 (UTC)

 * Most excellent work. Award yourself a wikimedal for janitorial services, that man! TB 21:25, Jul 23, 2004 (UTC)


text:
Talk:The Knight's Tale

Film
Is it correct to say that the film 'A Knight's Tale' is based on Chaucer's story of the same name? I see no points in common other than the title.

 * Well, there is Chaucer. And the pardoner and the summoner (IIRC) :-)

 * As I recall, the article makes it very clear that the connection is very tenuous at best, but I think there is at least a slight connection.

 * Atlant 11:04, 20 Apr 2005 (UTC)

Actually, The Movie "A Knight's Tale" is directly based on Chaucer's "The Knight's Tale". In both stories, the two main characters go to tournament over one girl. However, there are conflicting details, that is the overall story of both tales.

Now if you wish to search further into the subject, one could say that the movie is a story of the making of The Canterbury Tales. In the movie, Chaucer comes into contact with a great variety of people of medieval society and in the end of the movie he states that he's going to write the story, "All human activity lies within the artist's scope" which is an allusion to the writing of the Canterbury Tales. There are all sorts of allusions like this one throughout the movie, you just have to know what to look for.

Anonymous 11:28 AM, 11 Dec 2005

"It tries, but fails, to introduce many typical aspects of knighthood..."

Sounds POV to me. Makes critical judgement about effectiveness of Tale. May adjust. SheltonP 13:23, 8 March 2007 (UTC)

Emeleye
Emeleye actually first prays for the two of them to forget the whole thing, as she'd rather not marry, and wants to remain a virgin. The goddess Diane appears to her and tells her otherwise. Gaylegoh 19:22, 3 October 2007 (UTC)

Boccacio
I don't follow this "Teseida delle nozze di Emilia by Giovanni Boccaccio is the source of the tale. "The Knight's Tale", though, is a very loose translation, shortening Chaucer's 9000 line epic to a little over 2000 lines. Although some of the plot is lost, an undercurrent of philosophy is added by Boccaccio, mainly inspired by the Consolation of Philosophy of Boethius which Boccaccio had also translated." -- Beardo (talk) 08:05, 30 December 2007 (UTC)

This is terrible!
Who wrote this? Seriously. "The Knight and his tale supposedly embody the ideas of chivalry, but Chaucer's Knight, a book by Terry Jones, portrays the knight as a mercenary and far from a gallant, ethical, gentle character (though this theory has been widely disputed by the academic community)."

Terry Jones? Who the hell is Terry Jones? In line 74 of the prologue, Chaucer describes the knight as "Her was true, a perfect gentile-knight".

Mike (talk) 01:21, 29 October 2009 (UTC)
 * Courtesy link: Terry Jones. Though most famous as a member of Monty Python's Flying Circus, Jones read English ("but strayed into history") at Oxford and studied Chaucer as part of his English degree. FWIW, I read Chaucer's Knight in 1980 and found it well argued. He subsequently wrote several other historical works. {The poster formerly known as 87.81.230.195} 2.122.177.55 (talk) 03:50, 14 July 2019 (UTC)

 * It's a good thing we only invented irony in 2004, otherwise Chaucer could have been using it.FiendishThingie (talk) 11:47, 22 February 2010 (UTC)

 * Yes, though I agree with FiendishThingie, the narrator, and consequently the narration, of the Tales is actually a hotly debated topic. Though Chaucer, as the author of the work, is certainly treating the knight with irony, it is uncertain whether Chaucer is the narrator and is directly speaking about the knight sarcastically, or that the narrator is just another character in the tales and may genuinely believe that knight is "perfect gentile". Jwalkfour (talk) 13:37, 30 October 2012 (UTC)

Poetics
Should the sentence "The story is in iambic pentameter using 10 syllables for every line" be emended to say "The story is written in iambic pentameter end-rhymed couplets"? Iambs have two syllables and pentameter implies five of them (hence the ten syllables)--so the present sentence is redundant. It also seems that it would be good to mention the rhyming couplets.Mm2cat (talk) 20:31, 8 September 2011 (UTC)

Copyright problem removed
Prior content in this article duplicated one or more previously published sources. The material was copied from: http://pumaenglish.blogspot.ca/p/prologue-to-canterbury-tales.html http://www.sparknotes.com/lit/canterbury/section5.rhtml. Copied or closely paraphrased material has been rewritten or removed and must not be restored, unless it is duly released under a compatible license. (For more information, please see "using copyrighted works from others" if you are not the copyright holder of this material, or "donating copyrighted materials" if you are.)

For legal reasons, we cannot accept copyrighted text or images borrowed from other web sites or published material; such additions will be deleted. Contributors may use copyrighted publications as a source of information, and, if allowed under fair use, may copy sentences and phrases, provided they are included in quotation marks and referenced properly. The material may also be rewritten, providing it does not infringe on the copyright of the original or plagiarize from that source. Therefore, such paraphrased portions must provide their source. Please see our guideline on non-free text for how to properly implement limited quotations of copyrighted text. Wikipedia takes copyright violations very seriously, and persistent violators will be blocked from editing. While we appreciate contributions, we must require all contributors to understand and comply with these policies. Thank you. /wiae /tlk  12:17, 3 May 2017 (UTC)

External links modified
Hello fellow Wikipedians,

I have just modified 2 external links on The Knight's Tale. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:
 * Added archive https://web.archive.org/web/20150219130914/http://www.haverford.edu/engl/chaucer/students/dipaolo.htm to http://www.haverford.edu/engl/chaucer/students/dipaolo.htm
 * Added archive https://web.archive.org/web/20141220111140/http://www.unioviedo.es/SELIM/revista/resources/Selim-10/06Murtaugh.pdf to http://www.unioviedo.es/SELIM/revista/resources/Selim-10/06Murtaugh.pdf

When you have finished reviewing my changes, you may follow the instructions on the template below to fix any issues with the URLs.

Cheers.— InternetArchiveBot  (Report bug) 22:07, 10 December 2017 (UTC)

title: Talk:The Knight's Tale


text: Category:Armored divisions

title: Category:Armored divisions


text:
1863 in art

Events from the year 1863 in art.

Events

 * March – American-born painter James McNeill Whistler settles close to the River Thames in Chelsea, London, where he will live for most of the rest of his life.
 * June 12 – The Arts Club is founded by Charles Dickens, Anthony Trollope, Frederic Leighton and others in London's Mayfair as a social meeting place for those involved or interested in the creative arts.
 * The École des Beaux-Arts in Paris becomes independent of the Académie des Beaux-Arts.
 * Julia Margaret Cameron takes up photography.
 * Alexander Gilchrist's Life of William Blake, "Pictor Ignotus" is published in London, edited posthumously by Anne Gilchrist.

Exhibitions

 * May 17 – Opening of first exhibition of the Salon des Refusés in Paris (in which Manet exhibits Le déjeuner sur l'herbe and two other paintings; Whistler exhibits Symphony in White, No. 1: The White Girl and Cézanne first exhibits), and coining of the term avant-garde.

Works

 * Peter Nicolai Arbo – Horse Herd on the High Mountains
 * Thomas Jones Barker – 'The Secret of England's Greatness' (Queen Victoria presenting a Bible in the Audience Chamber at Windsor) (approximate date)
 * Albert Bierstadt – The Rocky Mountains, Lander's Peak
 * David Gilmour Blythe
 * Libby Prison
 * Man Eating in a Field
 * Alexey Bogolyubov – Easter procession in Yaroslavl
 * Alexandre Cabanel – The Birth of Venus (first version, Musée d'Orsay, Paris)
 * Paul Cézanne – The Judgement of Paris (approximate date)
 * Charles Camille Chazal – Institution of the Eucharist
 * François-Claudius Compte-Calix – Vieil Ami
 * Pierre Puvis de Chavannes – Work (Musée de Picardie, Amiens)
 * Joseph Durham – Memorial to the Great Exhibition, London
 * Thomas Charles Farrer – A Buckwheat Field on Thomas Cole's Farm
 * Jozef Israëls – Fishermen's Children (first version)
 * Italian – The Veiled Nun (marble bust, approximate date)
 * Vilhelm Kyhn – Efter solnedgang i udkanten af en landsby ("After Sunset on the Outskirts of a Village")
 * Édouard Manet
 * Le déjeuner sur l'herbe ("The Luncheon on the Grass" or "The Picnic") (Musée d'Orsay, Paris)
 * Olympia (Musée d'Orsay, Paris)
 * Robert Braithwaite Martineau – The Last Chapter
 * Jean-Louis-Ernest Meissonier – Napoleon III at the Battle of Solferino
 * John Everett Millais – My First Sermon
 * Albert Joseph Moore – Wall decorations at Coombe Abbey
 * Elisabet Ney – Eilhard Mitscherlich (sculpture)
 * Vincent Pilz – Pegasus (pair of bronzes) (approximate date)
 * Dante Gabriel Rossetti – Joan of Arc Kissing the Sword of Deliverance
 * Eugene von Guerard – North-east View from the Northern Top of Mount Kosciusko
 * Frederick Walker – The Lost Path
 * James McNeill Whistler – Grey and Silver: Old Battersea Reach

Births

 * January 11 – Mary Tannahill, American painter and artist in fabrics (died 1951)
 * January 29 – Suzette Holten, née Skovgaard, Danish painter and ceramist (died 1937)
 * April 3 – Henry van de Velde, Belgian painter, architect and designer, co-founder of the Art Nouveau movement (died 1957)
 * May 17 – C. R. Ashbee, English designer (died 1942)
 * June 12 – Bertram Mackennal, Australian sculptor (died 1931)
 * June 16 – Arturo Michelena, Venezuelan painter (died 1898)
 * June 21 – Anne Marie Carl-Nielsen, née Brodersen, Danish sculptor (died 1945)
 * June 27 – Henri Beau, Canadian Impressionist painter (died 1949)
 * August 30 (August 18 Old Style) – Sergey Prokudin-Gorsky, Russian color photographer (died 1944)
 * September 6 – Jessie Willcox Smith, American illustrator (died 1935)
 * October 24 – Bertha Jaques, American etcher (died 1941)
 * November 11 – Paul Signac, French neo-Impressionist painter (died 1935)
 * December 5 – George Pirie, Scottish painter (died 1946)
 * December 12 – Edvard Munch, Norwegian painter (died 1944)

Deaths

 * January 6 – Harriet Gouldsmith, English landscape painter and etcher (born 1787)
 * January 17 – Horace Vernet, French painter of battles, portraits, and Orientalist Arab subjects (born 1789)
 * February 6 – Karl Ludwig Frommel, German landscape painter and engraver (born 1789)
 * February 16 – Alvan Fisher, American pioneer in landscape painting and genre works (born 1792)
 * February 20 – John Cart Burgess, English watercolour painter of flowers and landscapes (born 1798)
 * April 4 – Ludwig Emil Grimm, German painter and engraver (born 1790)
 * June 5 – Marie Ellenrieder, German painter (born 1791)
 * July 7 – William Mulready, Irish genre painter of rural scenes (born 1786)
 * July 12 – Étienne-Jean Delécluze, French painter and critic (born 1781)
 * August 13 – Eugène Delacroix, French Romantic painter (born 1798)
 * September 19 – Joseph Nigg – Austrian painter, with painting on porcelain a specialty (born 1782)
 * December 4 – James Duffield Harding, English landscape painter (born 1798)
 * December 10 – Charles C. Ingham, Irish portrait painter and founder of the New York National Academy of Design (born 1797)
 * December 27 – Maria Martin, American watercolor painter (born 1796)
 * date unknown
 * Tommaso Benedetti, Austrian painter (born 1797)
 * Per Krafft the Younger, Swedish portrait and historical painter (born 1777)
 * Nukina Kaioku, Japanese painter and calligrapher (born 1778)
 * Johannes Baptista van Acker, Flemish portrait miniature painter (born 1794)

title: 1863 in art