Hint: You are looking at the most popular articles. If you are interested in popular topics instead, click here.

🔗 Russia 🔗 Literature 🔗 Russia/performing arts in Russia 🔗 Russia/language and literature of Russia

Chekhov's gun (Russian: Чеховское ружьё) is a dramatic principle that states that every element in a story must be necessary, and irrelevant elements should be removed. Elements should not appear to make "false promises" by never coming into play. The statement is recorded in letters by Anton Chekhov several times, with some variation:

• "Remove everything that has no relevance to the story. If you say in the first chapter that there is a rifle hanging on the wall, in the second or third chapter it absolutely must go off. If it's not going to be fired, it shouldn't be hanging there."
• "One must never place a loaded rifle on the stage if it isn't going to go off. It's wrong to make promises you don't mean to keep." Chekhov, letter to Aleksandr Semenovich Lazarev (pseudonym of A. S. Gruzinsky), 1 November 1889. Here the "gun" is a monologue that Chekhov deemed superfluous and unrelated to the rest of the play.
• "If in the first act you have hung a pistol on the wall, then in the following one it should be fired. Otherwise don't put it there." From Gurlyand's Reminiscences of A. P. Chekhov, in Teatr i iskusstvo 1904, No. 28, 11 July, p. 521.

Ernest Hemingway mocked the interpretation given by English instructors to the principle. He gives in his essay "The Art of the Short Story" an example of two characters that are introduced and then never again mentioned in his short story "Fifty Grand". Hemingway valued inconsequential details, but conceded that readers will inevitably seek symbolism and significance in these inconsequential details.

🔗 Biography 🔗 California 🔗 Computing 🔗 Chess 🔗 Biography/science and academia 🔗 Computing/Computer science 🔗 Robotics 🔗 Stanford University

John McCarthy (September 4, 1927 – October 24, 2011) was an American computer scientist and cognitive scientist. McCarthy was one of the founders of the discipline of artificial intelligence. He coined the term "artificial intelligence" (AI), developed the Lisp programming language family, significantly influenced the design of the ALGOL programming language, popularized time-sharing, invented garbage collection, and was very influential in the early development of AI.

McCarthy spent most of his career at Stanford University. He received many accolades and honors, such as the 1971 Turing Award for his contributions to the topic of AI, the United States National Medal of Science, and the Kyoto Prize.

🔗 Agriculture 🔗 Food and drink 🔗 Plants 🔗 Horticulture and Gardening 🔗 Genetics

Atomic gardening is a form of mutation breeding where plants are exposed to radioactive sources, typically cobalt-60, in order to generate mutations, some of which have turned out to be useful.

The practice of plant irradiation has resulted in the development of over 2000 new varieties of plants, most of which are now used in agricultural production. One example is the resistance to verticillium wilt of the "Todd's Mitcham" cultivar of peppermint which was produced from a breeding and test program at Brookhaven National Laboratory from the mid-1950s. Additionally, the Rio Star Grapefruit, developed at the Texas A&M Citrus Center in the 1970s, now accounts for over three quarters of the grapefruit produced in Texas.

🔗 Internet 🔗 Software 🔗 Software/Computing 🔗 Maps

Yahoo! Pipes was a web application from Yahoo! that provided a graphical user interface for building data mashups that aggregate web feeds, web pages, and other services, creating Web-based apps from various sources, and publishing those apps. The application worked by enabling users to "pipe" information from different sources and then set up rules for how that content should be modified (for example, filtering). Other than the pipe editing page, the website had a documentation page and a discussion page. The documentation page contained information about pipes including guides for the pipe editor and troubleshooting. The discussion page enabled users to discuss the pipes with other users.

🔗 Germany 🔗 Law Enforcement 🔗 Typography

The FE-Schrift or Fälschungserschwerende Schrift (forgery-impeding typeface) is a sans serif typeface introduced for use on licence plates. Its monospaced letters and numbers are slightly disproportionate to prevent easy modification and to improve machine readability. It has been developed in Germany where it has been mandatory since November 2000.

The abbreviation "FE" is derived from the compound German adjective "fälschungserschwerend" combining the noun "Fälschung" (falsification) and the verb "erschweren" (to hinder). "Schrift" means font in German. Other countries have later introduced the same or a derived typeface for license plates taking advantage of the proven design for the FE-Schrift.

🔗 United States 🔗 United States/Washington - Seattle 🔗 United States/Washington

Capitol Hill's mystery soda machine was a Coke vending machine in Capitol Hill, Seattle, that was in operation since at least the early 1990s until its disappearance in 2018. It is unknown who stocked the machine.

🔗 Economics 🔗 Statistics 🔗 Business 🔗 Politics

Goodhart's law is an adage named after economist Charles Goodhart, which has been phrased by Marilyn Strathern as "When a measure becomes a target, it ceases to be a good measure." One way in which this can occur is individuals trying to anticipate the effect of a policy and then taking actions that alter its outcome.

🔗 Food and drink 🔗 United Kingdom

A toast sandwich is a sandwich made with two slices of bread in which the filling is a thin slice of toasted bread, which can be heavily buttered. An 1861 recipe says to add salt and pepper to taste.

🔗 Philosophy 🔗 Philosophy/Philosophical literature 🔗 Books 🔗 Philosophy/Philosophy of science 🔗 Philosophy/Contemporary philosophy

Against Method: Outline of an Anarchistic Theory of Knowledge is a 1975 book about the philosophy of science by Paul Feyerabend, in which the author argues that science is an anarchic enterprise, not a nomic (customary) one. In the context of this work, the term anarchy refers to epistemological anarchy.

🔗 Mathematics 🔗 Statistics

The secretary problem is a problem that demonstrates a scenario involving optimal stopping theory. The problem has been studied extensively in the fields of applied probability, statistics, and decision theory. It is also known as the marriage problem, the sultan's dowry problem, the fussy suitor problem, the googol game, and the best choice problem.

The basic form of the problem is the following: imagine an administrator who wants to hire the best secretary out of ${\displaystyle n}$ rankable applicants for a position. The applicants are interviewed one by one in random order. A decision about each particular applicant is to be made immediately after the interview. Once rejected, an applicant cannot be recalled. During the interview, the administrator gains information sufficient to rank the applicant among all applicants interviewed so far, but is unaware of the quality of yet unseen applicants. The question is about the optimal strategy (stopping rule) to maximize the probability of selecting the best applicant. If the decision can be deferred to the end, this can be solved by the simple maximum selection algorithm of tracking the running maximum (and who achieved it), and selecting the overall maximum at the end. The difficulty is that the decision must be made immediately.

The shortest rigorous proof known so far is provided by the odds algorithm (Bruss 2000). It implies that the optimal win probability is always at least ${\displaystyle 1/e}$ (where e is the base of the natural logarithm), and that the latter holds even in a much greater generality (2003). The optimal stopping rule prescribes always rejecting the first ${\displaystyle \sim n/e}$ applicants that are interviewed and then stopping at the first applicant who is better than every applicant interviewed so far (or continuing to the last applicant if this never occurs). Sometimes this strategy is called the ${\displaystyle 1/e}$ stopping rule, because the probability of stopping at the best applicant with this strategy is about ${\displaystyle 1/e}$ already for moderate values of ${\displaystyle n}$. One reason why the secretary problem has received so much attention is that the optimal policy for the problem (the stopping rule) is simple and selects the single best candidate about 37% of the time, irrespective of whether there are 100 or 100 million applicants.