text:
Reflections (The Supremes album)

Reflections is the twelfth studio album recorded for Motown by Diana Ross & the Supremes. Released in 1968, it was the first regular studio LP to display the new billing of the group formerly known as "The Supremes." It contains the singles "Reflections", "In and Out of Love" and "Forever Came Today". Also included are covers of songs made famous by Martha and the Vandellas ("Love (Makes Me Do Foolish Things)") and The 5th Dimension ("Up, Up and Away"). Also present are songs written by other famous names, including "Bah-Bah-Bah" co-written by Motown singer Brenda Holloway with her younger sister, Patrice, an original Smokey Robinson composition titled "Then", and "What the World Needs Now Is Love" by Burt Bacharach and Hal David, which Motown planned to release as a single in the spring of 1968, but cancelled. It also contains a cover of Bobbie Gentry's "Ode to Billie Joe," whose original recording kept the single #2 "Reflections" from peaking at the top spot on the Billboard Hot 100 in September 1967, and it hit #2 on Cashbox.

The album includes the final songs the Supremes recorded with their main creative team of Holland–Dozier–Holland before the three writers/producers departed Motown over royalty and title disputes. Although Florence Ballard recorded some of this album before being fired from the group in July 1967, her replacement Cindy Birdsong along with Mary Wilson recorded several songs and appears on the album cover. Initially, the album cover included three photos with Ballard but it was quickly replaced with the cover featuring just Ross, Wilson and Birdsong. A photo of the original album cover can be found on Motown 45 rpm promotional sleeves issued in early 1968. One of the album's singles, "Forever Came Today", was later covered by The Jackson 5 on their 1975 album Moving Violation.

"In and Out of Love" was chosen to be the key song for the American Bandstand dance contest that year. Because of that exposure, the single remained #1 on American Bandstand's chart for an impressive four weeks. It outperformed "Reflections" with Dick Clark's audience affording the album two top three singles on that pivotal show.

Side one

 * 1) "Reflections" (Holland–Dozier–Holland) - 2:49
 * 2) "I'm Gonna Make It (I Will Wait for You)" (Debbie Dean, Dennis Lussier) - 2:47
 * 3) "Forever Came Today" (Holland-Dozier-Holland) - 2:59
 * 4) "I Can't Make It Alone" (Holland-Dozier-Holland) - 2:57
 * 5) "In and Out of Love" (Holland-Dozier-Holland) - 2:39
 * 6) "Bah-Bah-Bah" (Brenda Holloway, Patrice Holloway) - 2:58

Side two

 * 1) "What the World Needs Now Is Love" (Burt Bacharach, Hal David) - 2:50
 * 2) "Up, Up and Away" (Jimmy Webb) - 2:30
 * 3) "Love (Makes Me Do Foolish Things)" (Holland-Dozier-Holland) - 2:51
 * 4) "Then" (Smokey Robinson, Robert Rogers, Warren Moore) - 2:08
 * 5) "Misery Makes Its Home in My Heart" (Smokey Robinson, Warren Moore) - 2:52
 * 6) "Ode to Billie Joe" (Bobbie Gentry) - 4:30

Unused Recordings from the Reflections timeframe

 * 1) "My Guy" (Robinson)
 * 2) "It's Going All The Way To True Love" (Fuqua-Bristol-DeMell-Verdi)
 * 3) "Stay in My Lonely Arms" (Holland-Dozier-Holland)
 * 4) "Heaven Must Have Sent You" (Holland-Dozier-Holland)
 * 5) "Treat Me Nice John Henry" (Robinson)
 * 6) "Am I Asking Too Much" (Richards-Taylor)
 * 7) "All I Know About You" (Holland-Dozier-Holland-DeVol) (Released only as Motown 1107B (B-side of "The Happening", March 20, 1967)

Personnel

 * Diana Ross - lead vocals
 * Mary Wilson - backing vocals (side 1, tracks 1-2 and 5-6; side 2, tracks 1, 4-5)
 * Florence Ballard - backing vocals (side 1, track 5; side 2, track 1)
 * Cindy Birdsong - backing vocals (side 1, tracks 2 and 6; side 2, track 4)
 * The Andantes - backing vocals (side 1, tracks 3-5; side 2, tracks 2-3)
 * Marlene Barrow - backing vocals (side 1, track 1, side 2, track 5)
 * The Funk Brothers - instrumentation
 * Brian Holland, Lamont Dozier - producers on all tracks unless otherwise noted
 * Smokey Robinson - producer on "Then" and "Misery Makes Its Home in My Heart"

Singles history

 * "Reflections" b/w "Going Down for the Third Time" (B-side taken from The Supremes Sing Holland–Dozier–Holland) (Motown 1111, July 24, 1967)
 * "In and Out of Love" b/w "I Guess I'll Always Love You" (B-side taken from The Supremes Sing Holland-Dozier-Holland) (Motown 1116, October 25, 1967)
 * "Forever Came Today" b/w "Time Changes Things" (B-side taken from Meet The Supremes) (Motown 1122, February 29, 1968)

title: Reflections (The Supremes album)


text:
Shostka

Shostka (Шостка, ) is a city in Sumy Oblast, northeastern Ukraine. Shostka serves as the administrative center of Shostka Raion. Population:

The city lies on the Shostka River, a tributary of the Desna, from which it gets its name. Shostka is an important centre of industry: in chemicals (see Svema) and in dairy, the Shostka City Milk Plant was recently acquired by the Bel Group.

History
In 1739, a gunpowder factory was built there. Since that time, Shostka was one of the most important gunpowder suppliers in the Russian Empire. In 1893, a branch of a nearby railroad line was built. Shostka was granted municipal rights in 1920. In 1931, a film factory was built in Shostka which was one of the main suppliers of cinema and photo film in the USSR.

During the 2022 Russian Invasion of Ukraine, Shostka was besieged by Russian troops on February 24. and may have been partially occupied. During the withdrawal from the Chernihiv Oblast and Sumy Oblast, Russian troops left Shostka.

Demographics
Shostka's population: 1926 — 8,600 inhabitants, 1959 — 39,000 inhabitants, 1970 — 64,000 inhabitants, 1979 — 80,000 inhabitants, 1984 — 84,000 inhabitants.

Sports
Shostka is home to the Ukrainian football team Impuls Shostka.

The city is the birthplace of Lightweight Boxer Ivan Redkach.

In popular culture
Shostka is the hometown of the fictional Mousekewitz family in the 1986 animated film An American Tail, the opening of which depicts a Cossack (and cat) raid on the town.

Notable people

 * Dmitry Chechulin (1901, Shostka – 1981, Moscow), leading Soviet Stalinist architect
 * Vladimir Grigoryev, sportsman
 * Vitaliy Gulyaev, soldier
 * Ihor Molotok, politician
 * Iryna Novozhylova, sportswoman
 * Andriy Orlyk, sportsman
 * Ivan Redkach, sportsman
 * Vyacheslav Serdyuk, sportsman
 * Oleksandr Sorokalet (volleyball)
 * Olena Zubrilova, sportswoman

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

title: Shostka


text:
Shiksa

Shiksa (שיקסע) is an often disparaging, although not always, term for a gentile woman or girl. The word, which is of Yiddish origin, has moved into English usage and some Hebrew usage (as well as Polish and German), mostly in North American Jewish culture.

Among Orthodox Jews, the term may be used to describe a Jewish girl or woman who fails to follow Orthodox religious precepts.

The equivalent term for a non-Jewish male, used less frequently, is shegetz. Because of Jewish matrilineal descent, there is often less of a taboo associated with non-Jewish men.

Etymology
The etymology of the word shiksa is partly derived from the Hebrew term שקץ shekets, meaning "abomination", "impure," or "object of loathing", depending on the translator. According to the Oxford English Dictionary, it came into English usage in the late 19th century from the Yiddish shikse, which is an adaptation of the Hebrew word šiqṣâ, which is derived from sheqeṣ ("a detested thing") and the feminine suffix -â. A passage in which shekets (translated as "abomination") appeared in the Talmud to refer to people (rather than non-kosher actions) can be translated as: "Let him not marry the daughter of an unlearned and unobservant man, for they are an abomination and their wives a creeping thing."

Several dictionaries define shiksa as a disparaging and offensive term applied to a non-Jewish girl or woman.

North American and diaspora context
In North American and other diaspora Jewish communities, the use of "shiksa" reflects more social complexities than merely being a mild insult to non-Jewish women. A woman can only be a shiksa if she is perceived as such by Jewish people, usually Jewish men, making the term difficult to define; the Los Angeles Review of Books suggested there are two concepts of the shiksa, the forbidden seductress and the hag. Despite appearing in Yiddish literature for many decades, the term shiksa did not enter mainstream vernacular until the works of Philip Roth popularized it.

Severity
The term is typically considered pejorative but not a severe slur. Sometimes, response to its use has treated it as more severe. In 2009, it was recorded as a hate crime in Toronto. In 2014, Rabbi Jack Abramowitz described it as "simply indefensible", "inherently condescending, racist and misogynistic".

Israel and Orthodox context
In Israel, where most women are Jewish, the word is sometimes used among the religious as a pejorative to refer to Jewish women who are not Orthodox or who demonstrate unseemly irreligious behavior. In other Orthodox communities, it can be used in the same way.

In popular culture
The shiksa has appeared as a character type in Yiddish literature. In Hayim Nahman Bialik's Behind the Fence, a young shiksa woman is impregnated by a Jewish man but abandoned for an appropriate Jewish virgin woman. Her grandmother can be considered a hag form of the shiksa. More dangerous shiksas in literature include Shmuel Yosef Agnon's "Lady and the Peddler", in which a shiksa plans to eat the Jewish man she is dating, and I. L. Peretz "Monish", which sees a Jewish man fall into a hell-like place for loving a blonde woman.

As Jews populated American culture in the 20th century, more shiksa characters began to appear. Abie's Irish Rose focused on such a relationship, and the concept is mentioned in The Jazz Singer. Roth's books made the term mainstream, particularly Portnoy's Complaint in 1969. Roth placed the taboo nature of the shiksa in a cultural Jewish-American context, not a religious one. His work influenced that of Woody Allen, whose films depicted the concept. In American media, including Roth and Allen, the shiksa is often associated with eating lobster. The Los Angeles Review of Books noted that with more examples of shiksa characters, particularly on television, the concept became less taboo and more of a common stereotype.

Actresses Candice Bergen and Dianna Agron have both been described as "the archetypal shiksa" based on their roles; Agron is Jewish and Bergen is not, though she speaks Yiddish.

In 1997 Seinfeld episode "The Serenity Now", the term "shiksappeal" is used to describe the character Elaine and why every Jewish man she meets seems to be drawn to her.

In 2009 The Big Bang Theory episode "The Jiminy Conjecture", the Jewish Howard Wolowitz is explaining the term Shiksa, ("We don't pray to them - we prey on them!") to his best friend, the Hindu Dr. Rajesh Koothrappali. Raj wins the argument by pointing out their friend Dr. Leonard Hofstadter has one, while Howard does not.

In 2014, in the eighth episode of the fifth season of Downton Abbey, the term shiksa is used by the Jewish Lord Sinderby to describe Lady Rose MacClare (his son's Anglican fiancée) to his son Atticus Aldridge, as part of an argument between father and son over the former's disapproval of a non-Jewish marriage.

Derivatives
In Polish, siksa or sziksa is a pejorative but humorous word for an immature young girl or teenage girl. According to Polish language dictionary from 1915, it has been defined as "pisspants"; a conflation between the Yiddish term and its similarity to the Polish verb sikać ("to piss"). In today's language however, it is roughly equivalent to the English terms "snot-nosed brat", "little squirt", and "naughty schoolgirl" in a humorous context.

In German, schickse roughly means a promiscuous woman, with no religious or ethnic implications.

In Victorian England, London slang included "shickster" and "shakester", alternative spellings of the same word used among lower-class men to refer to the wives of their direct superiors (who were still lower-class women). As forms of the word entered British English more popularly, the implications became further detached, meaning variously a servant; a woman of low parentage; or a prostitute. By the middle of the 20th century, the word had dropped out of usage in Britain; the Los Angeles Review of Books suggests any continued use would be by older people referring to maids. The North American word "shiksa" is not (or rarely) used in British Jewish communities.

title: Shiksa


text:
Talk:Luberon

Untitled
I removed the link to the Alpilles since it wasn't explained in the article and the Alpille is adjacent to the Luberon but not in it. Jeremy J. Shapiro 16:18, 28 August 2005 (UTC)

External links modified
Hello fellow Wikipedians,

I have just modified 2 external links on Luberon. 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/20120731051511/http://lsbb.oca.eu/?lang=en to http://lsbb.oca.eu/?lang=en
 * Added archive https://web.archive.org/web/20090316054313/http://www.provence-luberon-news.com/en/Provence-Kiosk/Art-and-Gallery/Photography/Aerial-views-of-the-Luberon to http://www.provence-luberon-news.com/en/Provence-Kiosk/Art-and-Gallery/Photography/Aerial-views-of-the-Luberon/

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) 04:21, 1 December 2017 (UTC)

title: Talk:Luberon


text:
Guillaume d'Estouteville

Guillaume d'Estouteville (c. 1412–1483) was a French aristocrat of royal blood who became a leading bishop and cardinal. He held a number of Church offices simultaneously. He conducted the reexamination of the case of Jeanne d'Arc and exonerated her of the charges against her. He reformed the Statutes of the University of Paris. In Rome he became one of the most influential members of the Curia, as the official Protector of France in church business. Pope Sixtus IV appointed him Chamberlain of the Holy Roman Church (Camerlengo). His great wealth allowed him to be a generous patron of the arts, especially in the building and adornment of churches.

Life
D'Estouteville was born c. 1412 in either Valmont or Estouteville-Écalles in the Duchy of Normandy, a member of the most powerful family in the region. His father, Jean d'Estouteville, Sieur de Vallemont and Grand Chamberlain of France, had fought at Agincourt, was captured, and spent twenty years as a prisoner of war. His mother was Marguerite d'Harcourt, the daughter of Catherine de Bourbon, the sister of Jeanne de Bourbon who was the wife of King Charles V of France. Guillaume had an elder brother Louis, who became Grand Bouteiller of France. As the custom was, the younger brother was destined for a career in the Church. The family lost a great deal of property and income as a result of the English occupation of Normandy after the Battle of Agincourt. A collateral ancestor (uncle?), also called Guillaume d'Estouteville, had been Bishop of Évreux (1375–1376) at the age of twenty, Bishop of Auxerre (1376–1382), and Bishop of Lisieux (1382–1415).

It was first said by Alfonso Chacón, and often repeated thereafter, that Guillaume became a Benedictine monk at the Saint-Martin-des-Champs Priory in Paris, where he soon became prior. Both of these statements, however, have been shown to be mistaken. Documentary evidence written at Saint-Martin in 1500 shows that he was a secular priest, and that he was Administrator of Saint-Martin. Chacon also states that d'Estouteville was Doctor Decretorum (Doctor of Canon Law), but various papal documents of Pope Eugenius IV, in particular one of 1435, call him a Papal Notary, a relative of the Kings of France, a Master of Arts, and of Canon Law, as a result of having passed rigorous examinations. Henri Denifle states that d'Estouteville's degree in Canon Law did not come from the University of Paris. Guillaume did possess a Canonry in the Church of Évreux, and in 1432 he was Canon in Lyon as well. In 1433 he became Canon in Angers.

He later became commendatory abbot simultaneously of the Abbeys of Mont Saint-Michel (1444–1483), of Saint-Ouen at Rouen and of Montebourg.

Bishop
The Bishop of Angers, Hardouin du Brueil, died on 18 January 1439. Guillaume D'Estouteville, who was ambitious for the post, immediately rushed to Rome and obtained bulls from Pope Eugene IV on 20 February naming him to the bishopric. On 28 February the Canons of the Cathedral Chapter met and duly elected Jean Michel of Beauvais, a Councillor of Rene of Anjou and Canon of Rouen and of Angers, though d'Estouteville received several votes in the election. The election of Jean Michel was confirmed by the Vicars-General of the Archbishop of Tours. The bulls which d'Estouteville had obtained in Rome were presented to the Chapter of Angers on 24 April by d'Estouteville's procurator, but the majority of the Chapter rejected his bid. In the meantime Bishop Jean Michel was sitting as Bishop of Angers in the Council of Basel. King Charles VII of France was angered at the interference of the Pope in French church affairs and threatened, in support of the Gallican church, to apply the Pragmatic Sanction and exclude the Pope's bulls. Pope Eugene escaped from the danger by giving d'Estouteville the bishopric of Digne in the Alpes-de-Haute-Provence, a suffragan of Embrun. He renounced his claim on Angers on 27 October 1447.

On 18 April 1440, he was named the Apostolic Administrator of the Diocese of Mirepoix; his commission was revoked upon the appointment of a new bishop on 17 May 1441. He never visited Mirepoix, but he did collect a year's income.

Cardinal
A few months after the affair of Angers, Guillaume d'Estouteville was named a cardinal priest in the consistory of 18 December 1439 by Pope Eugene IV, and assigned the titular church of San Martino ai Monti. The Cardinal's hat probably softened the disappointment of losing the bishopric of Angers. Pope Eugene probably derived a bit of satisfaction at granting a red hat to a member of the French royalty without the request or consent of the King.

He was consecrated a bishop in January 1440. In 1440 he was briefly administrator of the diocese of Conserans (St. Lizier) The following year he was additionally appointed Administrator of the Dioceses of Béziers and Nîmes.

In 1443, Cardinal d'Estouteville was appointed Archpriest of the Basilica Liberiana (Santa Maria Maggiore) by Pope Eugene IV, in succession to Cardinal Niccolò Albergati, who had died on 9 May 1443. He held the position for life. In March 1451 Pope Nicholas V granted a new set of Statutes to the Canons of the Basilica, which emphasized the decisive power that the Archpriest had over the physical structure of the church and its property. In his Testament d'Estouteville left funds for the refurbishment and redecoration of the Chapel of S. Michele e S. Pietro in Vincoli, and for the building of the Chapel of S. Antonio.

On 7 January 1450 D'Estouteville was appointed Administrator of the Diocese of Lodève. He served in this office for three years, before being appointed bishop of the Diocese of Saint-Jean-de-Maurienne in Savoy. He was Bishop of Maurienne from 26 January 1453 to 20 April 1453, though he continued to act as Administrator of the diocese for the rest of his life. In April 1453 he was released from his obligation as Bishop of Maurienne and appointed Archbishop of Rouen by Nicholas V. The Canons of Rouen protested the violation of their rights, and Pope Nicholas granted them an Indult on 16 November promising them that, on the death of Guillaume d'Estouteville, they could elect whomever they wished. D'Estouteville took possession of the diocese of Rouen on 30 April 1453 through a Procurator, Bishop Louis d'Harcourt of Narbonne.

Diplomat
On 13 August 1451 Cardinal d'Estouteville was sent to France as legate by Pope Nicholas V, at the instigation of the Duc de Bourbon, to make peace between King Charles VII of France and England;  at the same time Cardinal Nicholas of Cusa was sent to England on the same mission. Both failed.

At the behest of the Inquisitor General Jean Brehal, Estouteville undertook an ex officio revision of the trial of Joan of Arc. He afterwards reformed the statutes of the University of Paris, issuing his decree on 1 June 1452. He shortened the course leading to the Doctorate in theology from fifteen to fourteen years, and he removed the requirement that Doctors of Medicine be in holy orders. He then presided over the Assembly of the French clergy which met at Bourges in July and August 1452 to discuss the implementation of the Pragmatic Sanction. He finally returned to Rome on 3 January 1453, where he passed almost all the rest of his life.

D'Estouteville, appointed Legate to the King of France, set out from Rome for France on 16 May 1454, with permission to be outside the Curia for six months; he returned to Rome on 12 September 1455 after sixteen months absence. His official mission was to attempt to persuade Charles VII to join in yet another crusade, the one that Nicholas V had tried to launch on 30 September 1453, following the Fall of Constantinople.

Rome
On his return, he built as his residence the Palazzo Apollinare to the west of the Church of S. Agostino and adjacent to the Church of S. Apollinare.

Conclaves
D'Estouteville participated in the papal conclave of 4–10 March 1447 that elected Pope Nicholas V. He was absent from Rome, however, during the sede vacante of 24 March–8 April 1455, prior to the election of Pope Calixtus III. On 20 February 1456 he was one of the cardinals who subscribed the bull of Pope Calixtus III which created Rodrigo Borgia a cardinal.

D'Estouteville took part in the Conclave of 6–19 August 1458 and was a candidate for the papacy in the Conclave. He was able to command six votes out of the nineteen participants, but he was defeated by Cardinal Aeneas Sylvius Piccolomini of Siena, who chose the name Pope Pius II.

In 1458 Cardinal d'Estouteville was asked by the Teutonic Knights to be their Protector at the Roman Curia, an honor and office which he accepted. D'Estouteville also was cardinal protector of the Augustinian Hermits. In January 1459 he accompanied Pope Pius II in his journey to Mantua to meet with the princes of Europe to arrange for a crusade against the Ottoman Turks.

He became Cardinal Bishop of Porto-Santa Rufina on 19 March 1459. He was named the Cardinal-Bishop of Ostia on 26 October 1461, and became the Dean of the College of Cardinals after the death of Cardinal Bessarion on 18 November 1472.

He took part in the Conclave of 27/28–30 August 1464, in which Pope Paul II (Pietro Barbo of Venice) was elected in the first Scrutiny.

On 11 January 1468 the Cardinal was elected Chamberlain of the College of Cardinals for a one-year term. This was a burdensome office, requiring the holder to see to it that monies due to the College of Cardinals from all sources, including the Pope, were collected, and to see to it that they were disbursed to the cardinals who were in the Roman Curia.

Campaign for the Papacy
Pope Paul died on 26 July 1471, and Cardinal d'Estouteville immediately began campaigning openly for the papacy. He wrote to Galeazzo Maria Sforza, Duke of Milan, seeking his support and that of the four cardinals who were 'Friends of the Prince'. But there were other candidates, notably Cardinal Bessarion, who was being supported by Venice. Eighteen cardinals, out of the twenty-five living cardinals, attended the Conclave, which began on 6 August 1471. In the second Scrutiny, on 9 August, Cardinal Francesco della Rovere was elected with thirteen of the eighteen votes. D'Estouteville had received six votes. Della Rovere chose as his papal name Sixtus IV.

On 25 August 1471, Cardinal d'Estouteville, availing himself of the traditional privilege of the Bishops of Ostia, consecrated Cardinal Francesco della Rovere, O.F.M.Conv., who had been elected Pope Sixtus IV, a bishop. The Coronation took place on the same day on the front steps of the Vatican Basilica by Cardinal Rodrigo Borja, the senior Cardinal Deacon.

The Cardinal also owed a vineyard near the Porta S. Maria del Popolo. On 15 May 1472 he gave a luncheon there in honor of Cardinal Rodrigo de Borja, who was leaving Rome on a mission to Catalonia and Spain. Earlier that day, the seals of the Chamberlain of the Sacred College were transferred from Cardinal Borjia, who was Chamberlain for the year, to Cardinal d'Estouteville, who was to fill out the rest of his term. On 12 October 1472, he was appointed in Consistory to be Legate in France. He was appointed Camerlengo of the Holy Roman Church (S.R.E. Camerarius) by Pope Sixtus IV in 1477, in succession to Cardinal Latino Orsini, who had died on 11 August 1477. D'Estouteville held the position until his death; he was the last non-Italian cardinal to hold the office for nearly five hundred years, until Jean-Marie Villot in 1970.

Patron of the Arts
Rouen (the episcopal palace), Mont Saint-Michel (the choir of the church), Pontoise (the episcopal palace), and the Château de Gaillon owe the construction of many buildings to his initiative. In his capacity as Bishop of Ostia d'Estouteville had the walls of the town restored, and built the Cathedral of Saint Aurea. In Velletri he rebuilt the episcopal palace. The cardinal also financed the rebuilding of the Church of St. Agostino in Rome. He then had the remains of Saint Monica, the mother of St. Augustine, brought from Ostia Antica for entombment in a marble sarcophagus he had built for them. His name prominently embellishes the façade. He is also credited with building the Church of S. Agostino at Cori and the Church of S. Agostino at Tolentino. He was a generous donor of sacred articles to the Church of San Luigi dei Francesi in March 1482.

D'Estouteville died in Rome on 22 January 1483. His remains were buried in the Basilica of Sant'Agostino. His heart, however, was removed, as was the custom, and taken to be placed in the tomb he had built for himself in the Cathedral of Rouen. A bust of him was placed at the entrance to the sacristy of S. Agostino, with an inscription dated 1865.

Family
With his mistress, Girolama Togli, Guillaume d'Estouteville had five children, including Girolamo Tuttavilla (Tuttavilla is an Italian version of Estouteville), a son Agostino, a daughter Margherita, and a daughter Giulia.

Works

 * Epistola ad heremitas Sancti Augustini (1475)

Episcopal Succession
Cardinal d'Estouteville performed a number of episcopal consecrations in Rome as part of his duties in the Roman Curia. He has the distinction of being the origin of the oldest extant, traceable episcopal lineage within the Catholic Church and the most numerous non-Rebiban lineage. This refers to the ongoing effort to trace the links from one bishop to his consecrator, to his consecrator, etc., all the way back to the Apostles. Thus far, the research has only been able to establish connections back to the mid-fifteenth century.

In the case of d'Estouteville, he consecrated Pope Sixtus IV; therefore, all bishops consecrated by Sixtus IV are in the "d'Estouteville Line". Sixtus IV consecrated Pope Julius II, and thus all bishops consecrated by Julius II are in the "d'Estouteville Line". Julius II consecrated Raffaele Riario, who consecrated Pope Leo X, and therefore all bishops consecrated by Leo X are in the "d'Estouteville Line". The major problem is that there is no evidence as to who consecrated d'Estouteville himself. The fact that there is a "d'Estouteville Line", therefore, is an accident of missing information.

While bishop, he was the principal consecrator of:

 * Amauri d'Acigné, Bishop of Nantes (1462);
 * Garsias de La Mothe, Bishop of Oloron (1465);
 * Giacopo Antonio Venier, Bishop of Siracusa (1465);
 * Antonio Alamandi, Bishop of Cahors (1466);
 * Brande Castiglioni, Bishop of Como (1466); and
 * Francesco della Rovere, (Pope Sixtus IV) (1471).

title: Guillaume d'Estouteville


text:
Torbay Express

The Torbay Express is a named passenger train operating in the United Kingdom.

The Torbay Express departs from Bristol Temple Meads railway station on summer Sundays at approximately 09:15 with arrival back in Bristol at about 20:10 (depending on the route).

Great Western Railway
The Torbay Express was a named train run by the Great Western Railway between Paddington and Kingswear, with a departure time from Paddington of 11:50. Originally the down train also included a slip portion for Ilfracombe, this being detached at Taunton. The departure time from London was changed to 12 noon before the First World War and continued at the same time until after World War II although the slip portion had ceased by 1918.

From 1961 the train, now the 12:30 from Paddington, split at Exeter St Davids with the other portion continuing to Plymouth, and in 1967 the name was dropped from the daily service and applied to a separate train running on Saturdays only and departing from Paddington at 10:50. In 1983 the name was again applied to a daily service when, in the summer timetable, the 9:20 Paddington to Paignton and 12:55 return had the name applied.

Torbay Pullman
In addition to the Torbay Express, in the summer of 1929 the GWR introduced an all-Pullman train leaving Paddington at 11:00 and arriving at Paignton at 12:25. The eight coach formation was then prepared for the return departure at 16:30. The service was not a commercial success and ceased in 1930.

Great Western Railway (TOC)
The Torbay Express name is also used by Great Western Railway (train operating company) for its 10:35 service from London Paddington to Paignton (via Castle Cary), and the 14:54 return (via Castle Cary and the Reading to Taunton Line).

Summer steam excursion
From 2003, Past-Time Rail revived the Torbay Express as a passenger charter steam locomotive service, to run on certain summer Sundays and some Saturdays, from: Bristol Temple Meads via stops at Weston-Super-Mare and Taunton; to Paignton and onwards via the Dartmouth Steam Railway to Kingswear. For the 2014 season, two of the booked railtours ran via Westbury instead of Weston-super-Mare, calling at Bath Spa, Trowbridge, Westbury and Taunton, then picking up the normal route. At first, this was done because of engineering works. However, thanks to its success, the same concept was repeated with two trains for the 2015 season.

After Past-Time Rail went bankrupt in June 2009, the service obligation has been taken over by Torbay Express Ltd. This company was formed as a subsidiary of booking agent Pathfinder Tours, itself a subsidiary of Riviera Trains. As well as taking direct bookings, the company also takes bookings through Pathfinder Tours, who advertise the service as part of their tour programme, and also supply their own volunteers to steward the trains.

Since being taken over by Pathfinder Tours/Riviera Trains, the British Railways Mark 1 coaching stock has been supplied in historic cream/brown by Riviera, and staffed by Pathfinder. The back-up diesel locomotive is supplied and operated by DB Schenker Rail (UK), sourced from a varying number of spot-hire companies, mainly West Coast Railways. During the operating season, the coaching stock is stabled in a spare covered road under the engine shed of Bristol Temple Meads, whilst the steam locomotive is stabled at a temporary operating base at Bristol Barton Hill MPD.

Initial steam power was supplied by GWR 7800 Class 7802 Bradley Manor and GWR 4073 Class 5051 Earl Bathurst, but has varied since by season, latterly supplied from the Jeremy Hosking-backed Locomotive Services Ltd. Motive power has included: GWR 6000 Class 6024 King Edward I; LNER Class A4 60009 Union of South Africa; LNER Class A1 60163 Tornado; SR Battle of Britain Class 34067 Tangmere; BR Class 8P 71000 Duke of Gloucester; BR Britannia Class 7MT 70000 Britannia; LNER Class A4 4464 Bittern; SR West Country Class 34046 Braunton; GWR 4073 Class 5029 Nunney Castle; LMS Royal Scot Class 46100 Royal Scot; SR Merchant Navy Class 35028 Clan Line.

title: Torbay Express


text:
Archibald Kennedy, 1st Marquess of Ailsa

Archibald Kennedy, 1st Marquess of Ailsa, KT, FRS (February 1770 – 8 September 1846), styled Lord Kennedy between 1792 and 1794 and known as the Earl of Cassilis between 1794 and 1831, was a Scottish peer.

Early life
Kennedy was the eldest son of Archibald Kennedy, 11th Earl of Cassilis, by Anne, daughter of John Watts. He became known by the courtesy title Lord Kennedy when his father succeeded to the earldom of Cassilis in 1792.

Career
Kennedy succeeded to the earldom on the death of his father 30 December 1794. He sat in the House of Lords as a Scottish representative peer between 1796 and 1806. In the latter year, he was created Baron Ailsa, of Ailsa in the County of Ayr, in the Peerage of the United Kingdom, which entitled him to an automatic seat in the House of Lords. He was admitted a Fellow of the Royal Society on 18 February 1819. In 1831 he was created Marquess of Ailsa, of the Isle of Ailsa in the County of Ayr. He voted for the Reform Bill in 1832. In 1820, King George IV made Archibald. a knight of the Order of the Thistle. This was an achievement that Sir Archibald had coveted for some time.

He had a taste for gambling. He owned racehorses and raced many that won cups in 1801 and 1802. He owned Clementina, Scaramouche, Pegasus, Chancellor, and Trimmer. He and 13 others established the Ayr Gold Cup held annually with only Scottish-trained horses that raced over a 2 mi run.

Personal life
Lord Ailsa married Margaret Erskine, the second daughter of Mary ( Baird) Erskine and John Erskine of Dun, Forfarshire, on 1 June 1793. They had six children:

 * Archibald Kennedy, Earl of Cassilis (1794–1832), who married Eleanor Allardyce and had issue.
 * Lady Anne Kennedy (1798–1877), who married Sir David Baird of Newbyth, 2nd Baronet and had issue.
 * Lady Margaret Kennedy (1800–1889), who married Thomas Radclyffe-Livingstone-Eyre.
 * Lady Mary Kennedy (1800–1886), who married Richard Oswald, son of Richard Alexander Oswald, MP for Ayr of Auchencruive Estate.
 * The Hon. John Kennedy-Erskine (1802–1831), who married Lady Augusta FitzClarence, an illegitimate daughter of King William IV and Dorothy Jordan and had issue (their granddaughter was the writer and poet Violet Jacob). John Kennedy-Erskine assumed the additional name of Erskine on being named heir to the House of Dun.
 * Lady Alicia Jane Kennedy (1805–1887), who married Jonathan Peel, Secretary of State for War, and had issue.

Lord Ailsa died in 1846 and was succeeded by his grandson, Archibald Kennedy.

Legacy
Lord Ailsa bought a house near Twickenham in London that had previously belonged to the playwright Richard Brinsley Sheridan. He named it "St Margaret's" and the name of the house has now been applied to the whole adjacent area. Ailsa Road and Ailsa Avenue in the area are also named after him.


text:
Talk:Otto of Greece

GA On Hold
I have reviewed this article and have expressed concerns about the following issues:

 * Expand lead per WP:LEAD, this should be able to stand on its own as a mini-article.
 * Biography section needs to be expanded, is there any information on his personal life/childhood?
 * Early reign section contains only 2 citations, there needs to be more. "The Greeks were soon more heavily taxed than under Turkish rule" How much more?, this could be considered questionable and needs a citation. "beautiful and talented Duchess Amelie of Oldenburg" is POV and needs a source.
 * " Not entirely faithful to his wife, he, like his father had a liaison with Jane Digby" this sentence is confusing, did both he and his father have a liason with the same woman, Jane Digby?
 * There are a few 1 sentence paragraphs, can these be merged with other paragraphs or expanded upon?
 * The parties section has only 1 citation, this is a major concern and needs to be cited more.
 * Exile and death section could be expanded, any details on death, how did he die? when did he die?
 * The images are a bit cluttered but look nice, they should be formatted so that they don't intersect the section headings.

The article passes criteria 1, 4, 5, and 6, it just needs serious work on the citations and expanding coverage on all sections.  T Rex  | talk  05:50, 14 August 2007 (UTC)

GA pass
I have passed this article becaue it passes all the good article criteria. To reach featured status it will need to address some of the concerns above as well as need to contain more citations. Congratulations!  T Rex  | talk  09:37, 20 August 2007 (UTC)

What was Otto's full name?
Otto must have had more than one Christian name, which must have been followed by some dynastic moniker - presumably "von" something. He must also have had more titles; indeed, he must have been born with at least one title, perhaps Prince or Duke of Whatever. What was his full name, and what other titles did he hold during his lifetime? Would some knowledgeable person like to edit them in? Tom129.93.17.202 17:46, 22 August 2007 (UTC)
 * Presumably Otto, Prince of Bavaria but the article already includes this.  T Rex  | talk  17:51, 22 August 2007 (UTC)
 * TRex is right: Otto Friedrich Ludwig von Wittelsbach, Prince of Bavaria and King of Greece would be his full style. Argos '  Dad  18:35, 22 August 2007 (UTC)

Reasons of his overthrow
Could someone elaborate what the reasons(or at least the pretext) behind the coup that overthrew him were?The article as it is now doesn't seem to mention them --129.107.81.15 (talk) 19:58, 11 May 2008 (UTC)

GA Sweeps
This article is part of the GA Sweeps for quality assessment. In reviewing this article I found that it has remained faithful to the GA criteria. See for my review. Overall the lead is good, you should add a couple of cites to some unsourced paragraphs and look to either expand or combine a couple of stub paragraphs. Otherwise I feel as though the article should be kept as GA. I made some minor corrections to the article as I reviewed it. If you have questions about this review please contact me on my talk page. H1nkles (talk) 19:19, 9 May 2009 (UTC)

What is his name?
I don't really care if it's "Otto" or "Othon", but we need to be consistent. I'm changing it all to Otto... now. StAnselm (talk) 22:24, 18 March 2010 (UTC)

Succession
Unlike it says in the infobox (and elsewhere in the article), Otto did not actually have a successor. George I was the King of the Hellenes, not the King of Greece like Otto. Can this be removed from the infobox, please. I know how to do it myself, of course, but I just want everyone watching this article to agree to this change, that’s all. — Preceding unsigned comment added by Johnanth (talk • contribs) 16:46, 21 January 2011 (UTC)

"the three Great Powers"
The lead refers to "the three Great Powers", without making it clear which they were; and the rest of the article does not make it clear. Likely candidates are Britain, Russia, Germany, the Ottoman Empire, France. Maproom (talk) 22:06, 6 February 2013 (UTC)

 * Britain, France, Russia. I edited the relevant part in the intro. --Greece666 (talk) 20:18, 17 August 2019 (UTC)

Manoli Tanga ???
The article says that king Othon had an illegitimate son called Manoli Tanga. I can't find any information about it and the article does't gove the page of the book SARAKATSANI – THE MOST ANCIENT PEOPLE OF EUROPE. May someone give more information about it ? Thanks a lot 31.39.53.205 (talk) 13:27, 26 January 2014 (UTC)

Statue at Missolonghi
The picture in the article titled "Statue of Otto in Missolonghi", is actually one of the two statues of Lord Byron in Missolonghi, as can also be seen here, here and here. There's no statue of King Otto in Missolonghi. --amadeus1eu (talk) 04:48, 15 August 2016 (UTC)

POV and unsubstuntiated claims in Parties, Finances and the Church

 * "Greek society was in reality very tolerant of other religions."

 * "But after 400 years of religious oppression by the Ottomans, Greeks were very suspicious of imposed "Liberal European progress". "

 * "By tradition dated back to the Byzantine era, the king was regarded by the Church as part of her head."

Actually, the two last paragraphs in the section Parties, Finances and the Church are irrelevant to Otto and are a general and very subjective summary of the religious history of Greece. They should probably be removed.

This is a pity because there is an excellent monograph on Otto´s reign by Petropulos. — Preceding unsigned comment added by Greece666 (talk • contribs) 19:58, 17 August 2019 (UTC)

title: Talk:Otto of Greece


text:
Talk:NP (complexity)

Simpler Algorithm
on long factorial(int n) {0p result = 1; while (n != 0) { result = result * n;     n = n - 1; }  return result; }

Introductory example
Is it best to open this article with an example of a challenging problem that is in P but not NP-complete? Composite/primality testing is in P; while the article hints at this, the reader is left a bit muddled as to the distinction between P and NP. -Czyl
 * I chose this example because it's particularly simple, and can generally rely on a basic math background, unlike satisfiability or graph colouring. Factoring is accessible, but again a little more complicated. It's a tradeoff. Deco 22:05, 30 August 2005 (UTC)

Can somebody fix this syntax? "All problems in NP have a deterministic function just like this, which accepts only when given both an input and proof that the input is in the language." I'm having trouble accepting "accepts" as an intransitive verb. Rsmoore 05:15, 28 March 2006 (UTC)

 * It is standard terminology in the literature. It is understood that machines act on their inputs. Think of accepts as short for 'goes to an accepting state'. Arvindn 05:52, 28 March 2006 (UTC)

"Nondeterministic machine branching into n different paths in just O(log n) steps" sounds wrong to me - isn't the point of nondeterminism that branching is free? 89.102.137.191 20:01, 10 July 2006 (UTC)

 * Nondeterministic Turing machines at least can only branch a fixed number of ways in each time step. Other models of nondeterministic machines might not have this limitation. Deco 20:19, 10 July 2006 (UTC)

Is the example in "Introduction and application" correct? I see a contradiction in the following statements from different wikipedia pages:

* http://en.wikipedia.org/wiki/Composite_number * (1) By definition, every integer greater than one is either a prime number or a composite number.

* http://en.wikipedia.org/wiki/NP_%28complexity%29 (this is the example I'm concerned about) * (2) As an example, consider the problem of determining whether a number n is a composite number. For large numbers, this seems like a very difficult problem to solve efficiently.

* http://en.wikipedia.org/wiki/Primality_testing * (3) As of 2007, factorization is a computationally hard problem, whereas primality testing is comparatively easy.

(1) and (3) => testing if a number is composite is as easy as testing if it's prime, which is in contradiction with (2). But it's possible that I'm just missing something. Inetic 23:38, 21 March 2007 (UTC)

 * Indeed, the section as I found it today doesn't seem to make any point at all and can't make up its mind whether primality testing is in NP or not and whether NP problems have polynomial-time solutions or not and whether polynomial-time and efficient are the same thing. I have rewritten it so all this is clear and it makes a point, but I'm not sure it's a 'valid' point.  In particular, the goal of the section seems to be to say what "the challenge of NP problems is," and I'm not sure I know what challenge the author was thinking of.  Maybe it's supposed to be the challenge of proving a problem 'is' in NP.  Bryan Henderson 16:58, 21 June 2007 (UTC)

 * I also don't like this approach. "Primality testing is in P. Now we'll prove that it's in NP." It's not that it's incorrect, it just feels strange. It would be more satisfying if primality testing was first proven to be in NP, and then a simple statement "In fact, primality testing has been proven to be in P as well, but only recently and it is much more difficult" or something to that effect. And it would be much more satisfying to introduce the subject with an example that isn't proven to be in P, such as an NP-complete problem. What about factorization? It shouldn't be too hard to demonstrate how verifying a factorization is in P, should it? -- Jao 20:00, 17 July 2007 (UTC)

 * Factorization is not NP-complete, although not known to be in P. On the P and NP page they settled on the subset sum problem. Dcoetzee 20:10, 17 July 2007 (UTC)

 * Thanks for briefing me on the status of factorization. As it didn't really matter here whether it was NP-complete or not, I hadn't researched it. Anyway, any NP problem not known to be in P would do, and the subset sum problem looks like a good example. -- Jao 20:38, 17 July 2007 (UTC)

The current description is wrong...
The latest edits to this page (made on June 21, 2007 at 16:51) are wrong. "Composite" is not NP-Complete. Many other edits are also incorrect (use of the term "machine" is more appropriate than "algorithm"). I am going to try to revert it back to the older version (if I can figure out how).

A.

Decision problem
After reading the article it's unclear to me whether an NP problem must be a decision problem. The lead says NP contains all decision problems...; but does it also contain other stuff? The examples include finding a number which (nontrivially) divides a given number, which isn't a decision problem, but the rest of the article implies that it should be. If an NP problem must be a decision problem, then perhaps contains could be changed to consists of, and the factoring example changed to whether a given number is composite (or just removed). --catslash (talk) 18:43, 11 October 2008 (UTC)
 * An NP problem must be a decision problem. The "contains" statement was meant to imply "contains and only contains". The factoring example was just plain incorrect (the correct decision problem is not whether a number is prime, which is in P, but a bit more complicated, see my edit). Dcoetzee 19:16, 11 October 2008 (UTC)
 * Thanks for clarifying that. The contains usage I'm not familiar with, so I'll change it to the is the set of - just revert it if this is not accurate. --catslash (talk) 20:09, 11 October 2008 (UTC)

I have a similar problem: In the Verifier-based definition the "subset sum problem" example is mentioned. While i find the example easy to understand, it is again in contradiction to the definition that NP is the set of all decision problems for which the 'yes'-answers have simple proofs of the fact that the answer is indeed 'yes'. In the example a given subset is verified to equal zero. However, I fail to see how a positively terminating non-deterministic Turing machine could be verified. —Preceding unsigned comment added by 131.220.99.58 (talk) 15:09, 10 February 2010 (UTC)

Travelling salesman
The decision problem of travelling salesman is said here to be in NP, but on the travelling salesman page, said to be NP-complete. —Preceding unsigned comment added by 138.16.19.86 (talk) 19:07, 9 November 2008 (UTC)

 * Every NP-complete problem is in NP. Blokhead (talk) 20:09, 9 November 2008 (UTC)

The current definition is possibly wrong
A mistake in the text:

I think "In an equivalent formal definition, NP is the set of decision problems solvable in polynomial time by a non-deterministic Turing machine." (located in the introduction) has to be "NP is the set of decision problems for which a yes answer can be checked in polynomial time". According to me it has to be like that otherwise there wouldn't be a difference with P, which is a subset op NP. The possibility that P=NP hasn't been proven yet.

Kind regards —Preceding unsigned comment added by BVDC (talk • contribs) 14:47, 6 December 2008 (UTC)
 * It's correct, and so is your definition. The two are equivalent and this is explained in detail later on in the article. The key is the word "non-deterministic" - a non-deterministic Turing machine is different from a deterministic (ordinary) Turing machine. Dcoetzee 17:05, 6 December 2008 (UTC)

Connection to Search Problems
I think this page should also cite the connection to search problems, since in practice many problems are formulated as search problems. Then, we can add that the search problem for an NP-complete decision problem is polytime-reducable to the decision problem, and if P=NP then every associated search problem is solvable in polynomial time. 85.124.63.18 (talk) 12:38, 23 February 2009 (UTC)
 * This is already covered by the statement that P=NP if and only if FP=FNP, which is discussed in P = NP problem. Dcoetzee 18:53, 23 February 2009 (UTC)

P subset of NP
User:Oddity- added a to the statement that NP contains "all problems in P". So I've added an explanation there, but feel free to remove it if you think it's badly written or that the fact doesn't need an explanation. Regards, Shreevatsa (talk) 23:27, 18 March 2009 (UTC)

Mistake in definition
There might be a mistake in definition of NP class. Article claims:

"In an equivalent formal definition, NP is the set of decision problems solvable in polynomial time by a non-deterministic Turing machine."

However according to definition from this article http://en.wikipedia.org/wiki/Decision_problem

A decision problem A is called decidable or effectively solvable if A is a recursive set. A problem is called partially decidable, semidecidable, solvable, or provable if A is a recursively enumerable set.

the definition should be:

"In an equivalent formal definition, NP is the set of decision problems effectively solvable in polynomial time by a non-deterministic Turing machine."

It is because the decision problem must be effectively solvable (decidable) by non-deterministic turing machine to be in NP class, in other words decision problem must be recursive set and not recursively enumerable set. —Preceding unsigned comment added by 77.48.31.4 (talk) 15:28, 11 May 2009 (UTC)
 * In the context of computational complexity, all machines are assumed to always terminate. Hence this ambiguity does not arise. In an introductory article that may bear emphasizing, to avoid confusing people coming from computability theory, but on the other hand that would also confuse people with no background in computability theory. Dcoetzee 07:47, 12 May 2009 (UTC)

Well yes, I came with some computability theory background and it confused me a bit. At least clarification now can be found here in discussion... —Preceding unsigned comment added by 141.202.248.68 (talk) 13:56, 12 May 2009 (UTC)

 * If it is 'solvable in polynomial time by a non-deterministic Turing machine, then it is effectively solvable in polynomial time by a non-deterministic Turing machine, by having a UTM run it for polynomially many steps, after which if the original machine hasn't given an answer, the UTM gives the answer "no".
 * JumpDiscont (talk) 16:48, 20 July 2010 (UTC)

The definition of NP belongs to Levin and Cook. This must be mentioned. 72.166.11.101 (talk) 06:10, 11 June 2011 (UTC)

I still don't see how this definition can be the right one - surely NP doesn't require that the decision problem can be solved in polynomial time in all cases (as implied by the definition as currently stated), but only in the "yes" cases? --Kotniski (talk) 09:00, 25 November 2011 (UTC)

 * I guess the confusion is about what it means for a non-deterministic machine to solve a decision problem. A non-deterministic machine non-deterministically chooses computation paths, so at the end of the computation there are many possible computation paths. A non-deterministic machine is said to solve a decision problem if, when the instance is a yes instance at least one computation path accepts, and when it is a no instance none of the paths accept. Now I think it is accurate to say that NP is the set of decision problems decidable in polynomial time by a non-deterministic Turing machine. --Robin (talk) 04:05, 30 November 2011 (UTC)
 * I still don't think so (and it certainly isn't intuitive to use this language) - you only have the solution in polynomial time if one of the paths accepts. If none of the paths accept, you've "decided" the problem, but not in polynomial time (or necessarily in any kind of time).--Kotniski (talk) 07:18, 30 November 2011 (UTC)
 * Each path terminates in polynomial time, and at the end announces whether the path has accepted or rejected. An NP machine is said to accept if any of the paths accepts. It is said to reject if all of the paths reject. It is said to run in polynomial time if all paths terminate in polynomial time. Does that sound more intuitive? --Robin (talk) 18:33, 1 December 2011 (UTC)
 * A bit, but it doesn't give a full explanation like that in the article, so I still think the wording is misleading and needs to be clarified for the semi-informed reader.--Kotniski (talk) 06:45, 2 December 2011 (UTC)

I mean, the definition you've restored says that the problem is "decidable in polynomial time by a non-deterministic machine..." We could at least say (in line with the wording you've just used) that it's "decidable by a non-deterministic machine that runs in polynomial time..." Acceptable?--Kotniski (talk) 06:48, 2 December 2011 (UTC)
 * Yeah, sure. Both sentences mean the same thing to me, but I can see why you feel that the second one might be clearer. --Robin (talk) 15:39, 3 December 2011 (UTC)
 * I inserted this wording, then, but added a bracketed explanation since it still won't be clear to many. The same confusion (possibly about substance rather than wording) seems to have arisen at NTIME; I've started a thread at User talk:129.104.247.2 to try to resolve it.--Kotniski (talk) 12:07, 6 December 2011 (UTC)

In in the name of holy heck is this about. It seems like the only people who are going to understand this are those who already know what it means. Surely your expertise should enable the authoring of an article that is useful to someone who does not have a masters in...well I'm not even sure what the discipline is. — Preceding unsigned comment added by 203.167.234.102 (talk) 23:01, 13 February 2012 (UTC)

Relation to MA
Isn't the current explanation of the relationship between NP and MA wrong as stated? It says "no communication from Merlin to Arthur". Shouldn't it say "no communication from Arthur to Merlin"? If Merlin doesn't communicate to Arthur then you just have BPP, right? — Preceding unsigned comment added by 165.91.14.139 (talk) 21:09, 21 February 2012 (UTC)

 * (Over 3 years later,) I fixed that problem. JumpDiscont (talk) 10:40, 2 July 2015 (UTC)

Incorrect formal definition?
The formal definition of the article states: For all x and y, the machine M runs in time p(|x|) on input (x,y)

I'm not an expert in the field but this leads to think that M must run in time p(|x|) regardless of the size of y, which doesn't seem to be true, at least if M reads y completely. What if |y| > p(|x|)?

I don't know if the article's definition is incorrect (it seems it is) but at least I think it's worth clarifying. Actually, in this respect I can quote "COMPUTERS AND INTRACTABILITY A Guide to the Theory of NP-Completeness" by Michael R. Garey / David S. Johnson. In their definition of NP base on deterministic verifiers (very similar to the one in the article) they state (on page 29):

"Notice that this has the effect of imposing a polynomial bound on the size of the quessed structure S [y in the article], since only a polynomially bounded amount of time can be spent examining that guess."

Should we modify the definition to "For all x and y, the machine M runs in time p(|x|+|y|) on input (x,y)" or at least add a clarification similar to the one in the book I quoted?

83.226.144.206 (talk) 23:32, 22 March 2014 (UTC)

I would "second" that the formal definition needs work. Specifically, it needs a citation. The problem is that there is no description of what "M" is doing - it's verifying a claim that y is a string in language x. We need a citation here.

two-dimensional euclidean TSP is a bad example
The section called Why some NP Complete problems are hard to solve contains the text ''Also, the real life applications of some problems are easier than their theoretical equivalents. For example, inputs to the general Travelling salesman problem need not obey the triangle inequality, unlike real road networks.''.

This is a bad example; two-dimensional euclidean TSP is still NP-complete. I strongly doubt that general two-dimensional euclidean TSP is easier than general TSP in any way which we can formalize. Furthermore, two-dimensional euclidean TSP could itself be considered a rather theoretical problem, because it is widely studied in the literature and it is probably of little use in most practical applications without significant adaptation.

I do not know of a better example off the top of my head, but I would rather have no example here than an example which is so misleading that it borders on being factually incorrect. Would anyone object if I removed the second sentence of the above quote from the article? Wikiedit738 (talk) 09:05, 8 April 2015 (UTC)

Possible Ultimate Definition
If it is of interest to discuss, here you can read some demonstrations solving the relationship between P, NP and #P

http://rekpub.com/American%20Open%20Computer%20Science%20Journal/Current%20Issue.php — Preceding unsigned comment added by JuanManuelDato (talk • contribs) 12:06, 23 August 2015 (UTC)

Introduction confusion
I see from previous comments that the intro has been hashed over several times already. However, at the current time, it still doesn't get across a clear idea of the criteria for problems described as NP.

It gives one definition:

"NP is the set of all decision problems for which the instances where the answer is "yes" have efficiently verifiable proofs [... that is] verifiable in polynomial time by a deterministic Turing machine."

This may be true, but doesn't indicate why "NON-deterministic" is part of the name of this set.

The intro's second definition:

"NP is the set of decision problems where the "yes"-instances can be accepted in polynomial time by a non-deterministic Turing machine."

... seems to throw the first definition into doubt. If an NDTM is required to accept (verify) yes answers (in poly time), then the first definition seems wrong.

I would like to see a description that simply explains the concept by starting with the name of this complexity class:

NP: Nondeterministic, Polynomial time" [Note the comma, I'm pretty sure we're not talking about nondeterminism of polynomial time.]

"A class of decision problems for which a Nondeterministic Turing Machine can do [something] within polynomial time."

Now, what is the [something]?

Verify a solution, so long as it's a yes? Determine whether a proposed solution is a yes or no? Or? I'm hoping someone will spell this out. In less than polynomial time :-).

Gwideman (talk) 21:43, 28 October 2015 (UTC)

 * I agree it doesn't make sense. I think the second definition in the introduction is wrong.  A NDTM can "solve" NP problems in poly time, not just "accept" yes-instances.  This is corroborated in the body of the article under "machine definition".  I will try to correct the intro but I would appreciate it if someone can verify this. Ajnosek (talk) 16:36, 18 July 2016 (UTC)

Lack of History and Meta-Encyclopedic Information
This article may benefit from a paragraph on the history of the problem, including a summary of the major research conveying the lineage of researchers as well. For example the researcher Ladner is mentioned in the diagram caption, but there is no mention in the article body and little mention of anyone else, or how and why the problem was discovered and evolved academically.

While all of those things are probably covered in other complexity theory articles, and taking under consideration there may be repetition between this article and NP-hard, NP-complete, etc when it comes to meta information: it still seems NP is central enough not only to theory, but practical computing itself, warranting a little more than just a technical lecture. — Preceding unsigned comment added by Jasonzemos (talk • contribs) 17:59, 5 December 2016 (UTC)

Possible issue with definition, again
The article says at the top: "...have proofs verifiable in polynomial time by a nondeterministic Turing machine". Shouldn't the verifiable bit be doable even by a *deterministic* (no-non) one? --> — Preceding unsigned comment added by 31.205.55.139 (talk • contribs) 01:15, 14 May 2021 (UTC)

 * Yeah, that's correct; I'll fix it in a jiffy. NP problems are those that can be *solved* by nondeterministic Turing machines, but verified by *deterministic* Turing machines. (The current definition is actually defining NP^NP, the second level of the polynomial hierarchy). By the way, I manually signed your comment for you, but you should sign your comments in the future (which you can do by typing four tildes in a row). Duckmather (talk) 03:53, 14 May 2021 (UTC)

Verifiable in non-deterministic polynomial time
Google search also shows definitions of NP as "verifiable in nondeterministic polynomial time".

That variant of the definition is missing in this article.

Is this (third) variant of definition of NP correct? If yes, add it with a reliable authoritative citation! --VictorPorton (talk) 14:03, 4 July 2021 (UTC)

 * It seems that the definition "verifiable in nondeterministic polynomial time" is wrong, because it would imply that a problem verifiable by another algorithm in NP would be itself in NP. But that would imply that every P problem is NP, because an NP algorithm could be verified by itself! Note that Wolfram's MathWorld does contain this (apparent) error. We should refer to such sources (including MathWorld) with the note that they have an error, as I understand. --VictorPorton (talk) 14:11, 4 July 2021 (UTC)

 * The variant is correct (if properly defined), and there are different ways to explain it; for me the most natural is to understand verification as defined in the main article. Now, allowing the verifier to be deterministic is equivalent to making it deterministic while providing it with an additional witness $$y'$$ to replace the non-deterministic choices. This witness is of polynomial size (in $$x$$) and so the new algorithm falls under the currently given definition. I am not aware of a source I could cite, so I'm not adding this to the article. AmirOnWiki (talk) 08:27, 24 July 2021 (UTC)

References to nondeterministic Turing machines in the introduction
I edited a reference to nondeterministic algorithm (as in computer programming) in a context where it actually refers to nondeterministic Turing machine, but I undid it since I realized that there are already two references to nondeterministic TMs in the introduction.

I'm not sure what are the guidelines around that, but shouldn't we use a reference only in the first instance? Also, maybe the reference to nondeterministic algorithm should be removed? Eduardogbg (talk) 18:09, 18 August 2023 (UTC)

title: Talk:NP (complexity)


text:
David D. Clark

David Dana "Dave" Clark (born April 7, 1944) is an American computer scientist and Internet pioneer who has been involved with Internet developments since the mid-1970s. He currently works as a senior research scientist at MIT's Computer Science and Artificial Intelligence Laboratory (CSAIL).

Education
He graduated from Swarthmore College in 1966. In 1968, he received his master's and engineer's degrees in electrical engineering from MIT, where he worked on the I/O architecture of Multics under Jerry Saltzer. He received his Ph.D. in electrical engineering from MIT in 1973.

Career
From 1981 to 1989, he acted as chief protocol architect in the development of the Internet, and chaired the Internet Activities Board, which later became the Internet Architecture Board. He has also served as chairman of the Computer Sciences and Telecommunications Board of the National Research Council.

In 1990 he was awarded the SIGCOMM Award in recognition of his major contributions to Internet protocol and architecture. Clark received in 1998 the IEEE Richard W. Hamming Medal.

In 1996, Clark was elected a member of the National Academy of Engineering for the design and development of efficient implementation techniques for Internet protocols. In 1998, he was elevated to Fellow of the IEEE for leadership in the engineering and deployment of the protocols that embody the Internet. In 2001, he was inducted as a Fellow of the Association for Computing Machinery.

Also in 2001, he was awarded the Telluride Tech Festival Award of Technology in Telluride, Colorado, and in 2011 the Internet & Society Lifetime Achievement Award from the Oxford Internet Institute at the Oxford University. In 2013, he was inducted into the Internet Hall of Fame.

His recent research interests include what the architecture of the Internet will look like in the post-PC era as well as "extensions to the Internet to support real-time traffic, explicit allocation of service, pricing and related economic issues, and policy issues surrounding local loop employment".

Legacy
Clark has been credited with a popular statement in the computer science realm: "We reject: kings, presidents, and voting. We believe in: rough consensus and running code."

In 1999, law professor Lawrence Lessig stated that "rough consensus and running code" had broad significance as "a manifesto that will define our generation.' Clark's new ethos of consensus has become a widely used methodology software development today and replaced a more top down approach that existed in the 80s.

Selected publications

 * David D. Clark, "An Input/Output Architecture for Virtual Memory Computer Systems", Ph.D. dissertation, Project MAC Technical Report 117, January 1974
 * L. W. McKnight, W. Lehr, David D. Clark (eds.), Internet Telephony, MIT Press, 2001, ISBN 0-262-13385-7
 * David D. Clark, "The Design Philosophy of the DARPA Internet Protocols", Computer Communications Review 18:4, August 1988, pp. 106–114
 * R. Braden, David D. Clark, S. Shenker, and J. Wroclawski, "Developing a Next-Generation Internet Architecture", ISI white paper, 2000
 * David D. Clark, K. Sollins, J. Wroclawski, R. Braden, "Tussle in Cyberspace: Defining Tomorrow’s Internet", Proceedings of SIGCOMM 2002, ACM Press, 2002
 * David D. Clark, K. Sollins, J. Wroclawski, and T. Faber, "Addressing Reality: An Architectural Response to Real-World Demands on the Evolving Internet", ACM SIGCOMM 2003 Workshops, Karlsruhe, August 2003

title: David D. Clark


text:
WoodmenLife

WoodmenLife (officially Woodmen of the World Life Insurance Society) is a not-for-profit fraternal benefit society founded in 1890, based in Omaha, Nebraska, United States, that operates a large privately held insurance company for its members.

The history of the organization includes numerous philanthropic efforts and community outreach projects; distinctive headstones depicting tree stumps across the United States and Canada before 1930, a program to present American flags, and broadcast interests that owned the first television station where Johnny Carson worked.

History
The organization was founded in 1890 in Omaha, Nebraska, by Joseph Cullen Root. Root founded Modern Woodmen of America (MWA) in Lyons, Iowa, in 1883, after hearing a sermon about "pioneer woodsmen clearing away the forest to provide for their families". Taking his own surname to heart, he wanted to start a society that "would clear away problems of financial security for its members".

After internal dissension within the MWA, Root was ejected from the organization that he had founded. When moving to Omaha, Root decided to start again with a new group he called the Modern Woodmen of the World. He soon dropped the "Modern", and the organization became "Woodmen of the World".

Woodmen of the World began marketing itself as WoodmenLife on June 1, 2015.

Mergers
Over the years a number of smaller fraternal organizations have been absorbed into WoodmenLife, including the United Order of the Golden Cross (a temperance movement association founded by J. H. Morgan) in 1962, the benefits operation of the Order of Railroad Telegraphers in 1962, and the New England Order of Protection in 1969.

The Woodmen of the World had a female auxiliary called the Woodmen Circles from the early 1890s. Its local units were called local "Groves" and they were governed by a "Supreme Forest", subject to the Sovereign Camp of the Woodmen of the World. The Circle eventually reached 130,000 members, but it was absorbed by the Woodmen in 1965. During the Woodmen Circle convention of 1897, delegates from nine western states declared their intention to leave the national organization. They formed a new organization called the "Pacific Circle, Women of Woodcraft". It changed its name to the Neighbors of Woodcraft in 1917, but it merged with the Woodmen of the World in July 2001.

The first Boys of Woodcraft unit was founded in Jacksonville, Florida, in 1903, by J.M. Taylor. In 1979, the Boys of Woodcraft Sportsmen's Clubs and the Girls of Woodcraft merged into the Woodmen Rangers and Rangerettes. This youth affiliate had 115,471 members in 1979.

In the current constitution youth affiliates are called Youth Chapters which are affiliated to adult Chapters.

Buildings
The organization used to own a 19-story tower at 14th and Farnam streets which was the tallest building between Chicago and the West Coast at the time of its dedication in 1912. WOW built its current 30-story Woodmen Tower in 1969. It was Nebraska's tallest building until the completion of the 45-story First National Bank Tower in 2002.

The original WOW building was demolished in 1977.

Broadcasting
The organization played an important role in broadcast history, inaugurating broadcasting service on November 27, 1922, on its radio station WOAW, with a signal that reached ships in the Atlantic and Pacific Oceans from its 500-watt (later 1,000 watt, and eventually 5,000 watt) transmitters. In 1926, the station became WOW after the ship SS Henry J. Bibble, which had held the call sign, was retired from service.

In 1943 the society decided to retire from broadcasting, and leased the station to a group of local investors who formed Radio Station WOW, Inc. The society assigned the FCC license to the group.

Meredith Corporation acquired the stock of the company in 1951, which by that time had placed a companion television station on the air (now WOWT). Meredith added an FM station in 1961 (now KEZO-FM).

In 1999, Journal Broadcast Group changed the AM station's rare three-letter call sign to KOMJ. With a subsequent program format change in 2005, the station became KXSP.

Headstones
A physical legacy of the organization are "Treestones" or "tree-stump tombstones" marking the grave of a Woodman of the World. The sawed off tree limbs represent a life cut short. These headstones were used because, "until the 1920s, membership in the Woodmen of the World provided each member with a tombstone."

Organization
Historically, the top of the organizational structure of WoodmenLife was the "Sovereign Camp", which met quadrennially. When the Sovereign Camp was not in session the organizations was run by a board of directors. States were called either "Jurisdictions" or "Head Camps". Local groups were called either "Camps", "Courts" or "Groves". There were 4,000 locals in 1979.

Locals are now called Chapters which are part of geographical Jurisdictions. Chapters elect delegates to the Jurisdictional Conventions held every two years who in turn elect delegates to the National Conventions which are held every four. The governing body of WoodmenLife is the National Convention. In between conventions the organization is run by a board of directors which includes the president and CEO; executive vice president; secretary and general counsel; executive vice president, chief financial officer (CFO); executive vice president, chief operating officer (COO); and up to ten additional members.

In film
In the film About Schmidt (2002), Jack Nicholson plays a retired Woodmen executive actuary.

Financial standing
WoodmenLife has been awarded a rating of A+, the second highest ranking out of 15, for its financial strength and operating performance by A.M. Best.

title: WoodmenLife


text:
You Wish! (film)

You Wish! is a 2003 American fantasy comedy film released as a Disney Channel Original Movie and based on Jackie French Koller's 1991 novel If I Had One Wish. The film was directed by Paul Hoen; it stars A. J. Trauth, Spencer Breslin, Lalaine and Tim Reid. The film was filmed in Auckland, New Zealand. It was released on January 10, 2003, on the Disney Channel.

Plot
16-year-old Alex Lansing is extremely tormented by his younger brother, Stevie such as he plays pranks on Alex, including buying a turkey from a pet adoption show and causing the Harbour High jocks, Gary and friends to slam a pizza on Alex's head. When Alex is forced to take Stevie to the mall with his friend James, Stevie receives a magical coin from Larry Pendragon, a kindly eccentric man, which allows him to wish anything, and proceeds to run off in the mall without telling Alex. Later, their parents punish Alex, having had enough with his carelessness and send him to bed early. Stevie gives Alex the coin to make amends, and Alex wishes that he had never had a little brother.

The next day, he wakes up to find that his wish has come true. Stevie is now a famous child actor named Terrence Russell McCormack who stars on a TV show called Where's Stevie?. Although now dating a cheerleader and popular at school, Alex has regrets when his new popular jock friends torment his old friends, Abby and James. Alex's new pet dog is nothing but creepy and annoys him with his snoring while his new girlfriend, Fiona the cheerleader, is revealed to be crude, mean, and bossy. After a while, Alex begins to miss Stevie, feeling lonely at home with their career-obsessed parents. Alex seeks out Terrance to explain to him that they are brothers, but is kicked out of his dressing room, Terrance thinking he is crazy. Alex reflects on his life with Stevie and realizes how much he cares about him and misses him. As Alex walks home, Terrance drives by and decides to walk with Alex, who he begins to consider a friend. When they realize this is happening because of the coin, Alex and Terrance set out to find it, enlisting the help of Abby once Alex convinces her they were friends prior to his wish. The three locate Larry Pendragon, but he had to close his shop and has already sold off the coin.

After saying goodbye to Abby, Alex and Terrance are caught by the police and are taken to Alex's home where Terrance's caretaker comes to get him with the intention of covering up his absence. Terrance gets a call from his mother and is excited as he had the best night of his life, but is quickly disappointed when he learns his mother is getting remarried. Alex and Terrance share a brotherly hug and say goodbye and Alex slips into a depression because he has no chance of returning to his previous world.

The next day, while Alex is trying to find something on TV that does not remind him of his relationship with Stevie, his father gives him a bunch of old coins he bought to try to cheer him up. Alex throws them across the room, then discovers that one is the magic coin. Alex retrieves it, but his shout of excitement frightens his parents and they decide to break his door down when he refuses to open it. Before they can, Alex wishes that he never made the first wish and wakes up back in his own world. Alex excitedly embraces Stevie and his friends and asks Abby out, then yelling to a passing Fiona that he is not her boyfriend, confusing everyone. Later, Alex, James and Abby go skating and take Stevie with them and try to teach him to skate. He gives up, but then uses the coin to become a great skater.

Cast

 * A.J. Trauth as Alex Lansing
 * Spencer Breslin as Stevie Lansing / Terrence Russell McCormack
 * Lalaine as Abby Ramirez
 * Tim Reid as Larry Pendragon
 * Peter Feeney as David Carl "Dave" Lansing
 * Joshua Leys as Gary
 * Sally Stockwell as Pam Lansing
 * Ari Boyland as James Cooper
 * Emma Lahana as Fiona
 * Jay Ryan as Charles
 * Jodie Rimmer as Zoe
 * Stephen Butterworth as Ronald

Credits adapted from Rotten Tomatoes.

Production
The film was shot in New Zealand, at Studio West in West Auckland.

Critical reception
Writing for Los Angeles Times, Mark Sachs praised You Wish! for its cast, script, and direction, calling the film "one of the best efforts of the basic cable outfit's original-movie franchise".

Soundtrack
The soundtrack included numerous songs, including:
 * "You Wish!" performed by Lalaine
 * "Now And Again" performed by Mavin (as Badge)
 * "A Thousand Miles" performed by Vanessa Carlton
 * "Life is Good" performed by Junk
 * "World of Our Own" performed by Westlife
 * "Follow My Heart" performed by REO Speedwagon

title: You Wish! (film)


text:
Capture of Fort Niagara

The Capture of Fort Niagara took place 18-19 December 1813  during the War of 1812 between Great Britain and the United States. The American garrison was taken by surprise, and the fort was captured in a night assault by a select force of British regular infantry.

Background
Fort Niagara was an important American post near the outlet of the Niagara River on Lake Ontario. During the early days of the war, it was involved in several exchanges of artillery fire against the British at Fort George on the other side of the river.

On 27 May 1813, the Americans won the Battle of Fort George. This left Fort George in their hands, and they briefly captured the entire Niagara peninsula, but they were then driven back to a narrow enclave around Fort George. Later during the year, almost all the regular soldiers on the Niagara front were redeployed to Sacket's Harbor to take part in an attack down the Saint Lawrence River against Montreal. They had briefly been replaced by regulars from the western theatre under William Henry Harrison, but in November these too had been ordered to march to protect Sacket's Harbor, which had been stripped of troops to furnish the Montreal expedition. This left Brigadier General George McClure of the New York militia with only 60 regulars, 40 volunteers from the New York militia and 100 Canadian Volunteers (renegades fighting for the United States) to hold Fort George.

Burning of Niagara
In late 1813, Major General Francis de Rottenburg, the British Lieutenant Governor of Upper Canada, had been alarmed by defeats in the west (the Battle of Lake Erie and the Battle of the Thames) and American concentrations to the east. On 9 October he ordered the troops on the Niagara peninsula to retreat hastily to Burlington Heights at the western end of Lake Ontario. He intended to abandon even this position and concentrate his forces at Kingston but during the first week in December, de Rottenburg was replaced by the more forceful Lieutenant General Gordon Drummond. Drummond was aware that the American attack on Montreal had been defeated, leaving the American army stranded in poorly-supplied winter quarters in Upper New York State. He immediately cancelled de Rottenburg's plans for further retreat, and ordered the units at Burlington Heights to advance instead.

On 10 December, McClure learned of this advance. He had despaired of receiving any reinforcements and decided his position was untenable. He hastily evacuated his troops to Fort Niagara. The artillery could not be withdrawn from Fort George and was thrown into the ditch surrounding the fort.

Earlier in the year, the United States Secretary of War, John Armstrong, had given permission to destroy the nearby village of Niagara (also known as Newark) if it became necessary to prevent British troops finding cover close to Fort George. The inhabitants were to be given several days' notice, and care was to be taken that they were not to be left destitute. As the Americans abandoned Fort George, McClure gave the order to burn down the village with only two hours warning, leaving the inhabitants without shelter or possessions in the depths of winter. Part of the village of Queenston was also torched. It was alleged that the pro-American Canadian Volunteers performed most of the destruction.

This action was undoubtedly contrary to the conventions which governed warfare at the time, although several similar acts had already been committed by both sides during the war.

Battle
Once the British had recovered Fort George, Fort Niagara was vulnerable to a British attack. Its defenders consisted of Captain Nathaniel Leonard's company of the 1st U.S. Artillery, Captain Frank Hampton's company of the 24th U.S. Infantry, and small detachments (mainly convalescents, wounded or sick men) from other regular units. Captain Leonard was in command of the fort. He had been attracting unfavourable reports from his superiors since taking charge of the fort in 1812 and was a notorious drunkard, but orders to replace him as commandant had not been carried out. The defences of Fort Niagara had been allowed to deteriorate and damage to the outer defences caused by artillery fire in 1812 and early 1813 had not been repaired, although this was not to be a factor in the fort's capture. Drummond had ordered boats to be brought forward from Burlington. They proceeded by water to the mouth of the Four Mile Creek, from where Canadian militia carried them overland on sledges to Fort George. On the night of 18 December, a force consisting of the 100th Foot, the grenadier company of the 1st Battalion of the Royal Scots, and the grenadier and light companies of the 41st Foot, with some small detachments of militia and Holcroft's Company, 4th Battalion Royal Artillery crossed the river 3 mi above Fort Niagara. The force numbered 562 and was under the command of Colonel John Murray, the commanding officer of the 100th Foot. They were equipped with axes and scaling ladders and under orders to use the bayonet so as not to lose the advantage of surprise.

They captured American pickets posted in the village of Youngstown, the men having been trying to stay warm instead of keeping watch. One of the prisoners was forced to reveal the American challenge and password. The British force then advanced silently towards the fort. An advance party of some artillerymen and the grenadier company of the 100th under a lieutenant and a sergeant approached the gate, where the sergeant affected an accent from the southern American states and confused the guard long enough to gain entry. By the time the defenders became aware of the deception, it was too late to stop the British from rushing in.

Resistance came mainly from two buildings, the South Redoubt and the Red Barracks, which was being used as a hospital. Some of the defenders barricaded themselves inside the South Redoubt of the fort and held off repeated attempts to break into the building. However, when they refused demands that they surrender, the British commander offered no quarter to the defenders. When the attackers forced their way into the building, the infamous order was given to "Bayonet the whole".

Casualties
Only six of the attackers were killed, with five wounded.

The British report on the engagement listed 65 Americans killed, 14 wounded prisoners and 344 other prisoners. However, Robert Lee, an American civilian who had been visiting the Fort when it was attacked, gave a sworn deposition on 18 January 1814 that the British report giving 65 Americans killed had been "issued very soon after they took possession of the fort and did not include a number that were afterwards found bayoneted in the cellars of the houses". Lee thought that "at least eighty" Americans had in fact been killed. Captain Leonard was captured at his home two miles away, allegedly drunk.

Aftermath
A force consisting of the centre companies of the Royal Scots and the 41st under Major General Phineas Riall followed Murray's troops across the river. At the Battle of Lewiston, they captured several outposts and batteries, and proceeded to burn down almost every village on the American side of the river, including Lewiston and a nearby settlement of Tuscarora Indians, in reprisal for the burning of Newark. Some Indians accompanied Riall; one source stated that up to 500 "Western Indians", who had remained with the British after the Battle of the Thames the previous autumn, took part. Many of the Indians (and some British soldiers) became drunk on looted liquor and several American settlers were scalped by the Indians. Riall was eventually prevented from advancing further south by some militia and Canadian Volunteers who destroyed the bridge over the Tonawanda Creek.

Having returned to the Canadian side of the Niagara, Riall marched upstream past Niagara Falls, carrying the boats. On 30 December, Riall crossed the Niagara again, 2 mi downstream of Black Rock and defeated American forces at the Battle of Buffalo, after which the villages of Black Rock and Buffalo were set ablaze and the navy yard on Buffalo Creek was destroyed.

Fort Niagara remained in British possession until the end of the war.

Battle Honours
In the tradition of British Army battle honours, this action was first awarded in 1815 as Niagara. Units present at the capture that hold this title include:
 * Captain Holcroft's company of the Royal Artillery, now known as 52 (Niagara) Battery Royal Artillery - (fought at the capture of Fort Niagara and the Battle of Lundy's Lane)
 * 100th Regiment of Foot (Prince Regent's County of Dublin Regiment) - Honour regranted in 1875 to successor regiment, the 100th (Prince of Wales's Royal Canadian) Regiment of Foot

Eight currently active battalions of the American Army (1-3 Inf, 2-3 Inf, 4-3 Inf, 1-4 Inf, 2-4 Inf, 3-4 Inf, 2-7 Inf and 3-7 Inf) perpetuate the lineages of three American infantry units (the old 14th, 19th and 24th Infantry Regiments) that were present at Fort Niagara.

title: Capture of Fort Niagara