Popular Articles (Page 11)

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

๐Ÿ”— Gรถdel's Loophole

๐Ÿ”— United States/U.S. Government ๐Ÿ”— United States ๐Ÿ”— Biography ๐Ÿ”— Philosophy ๐Ÿ”— Philosophy/Logic ๐Ÿ”— Biography/science and academia ๐Ÿ”— Philosophy/Contemporary philosophy ๐Ÿ”— Philosophy/Philosophers ๐Ÿ”— United States/U.S. history

Gรถdel's Loophole is a "inner contradiction" in the Constitution of the United States which Austrian-German-American logician, mathematician, and analytic philosopher Kurt Gรถdel claimed to have discovered in 1947. The flaw would have allowed the American democracy to be legally turned into a dictatorship. Gรถdel told his friend Oskar Morgenstern about the existence of the flaw and Morgenstern told Albert Einstein about it at the time, but Morgenstern, in his recollection of the incident in 1971, never mentioned the exact problem as Gรถdel saw it. This has led to speculation about the precise nature of what has come to be called "Gรถdel's Loophole". It has been called "one of the great unsolved problems of constitutional law."

Discussed on

๐Ÿ”— Aphantasia

๐Ÿ”— Medicine ๐Ÿ”— Psychology ๐Ÿ”— Disability ๐Ÿ”— Neuroscience

Aphantasia is a condition where one does not possess a functioning mind's eye and cannot voluntarily visualize imagery. The phenomenon was first described by Francis Galton in 1880 but has since remained largely unstudied. Interest in the phenomenon renewed after the publication of a study in 2015 conducted by a team led by Professor Adam Zeman of the University of Exeter, which also coined the term aphantasia. Research on the condition is still scarce.

Discussed on

๐Ÿ”— One Instruction Set Computer

๐Ÿ”— Computing ๐Ÿ”— Computer science

A one-instruction set computer (OISC), sometimes called an ultimate reduced instruction set computer (URISC), is an abstract machine that uses only one instructionย โ€“ obviating the need for a machine language opcode. With a judicious choice for the single instruction and given infinite resources, an OISC is capable of being a universal computer in the same manner as traditional computers that have multiple instructions. OISCs have been recommended as aids in teaching computer architecture and have been used as computational models in structural computing research.

Discussed on

๐Ÿ”— Zooko's Triangle

๐Ÿ”— Computing ๐Ÿ”— Computer Security ๐Ÿ”— Computer Security/Computing ๐Ÿ”— Computing/Software ๐Ÿ”— Computing/Computer science ๐Ÿ”— Cryptography ๐Ÿ”— Cryptography/Computer science ๐Ÿ”— Computing/Computer Security

Zooko's triangle is a trilemma of three properties that are generally considered desirable for names of participants in a network protocol:

  • Human-meaningful: Meaningful and memorable (low-entropy) names are provided to the users.
  • Secure: The amount of damage a malicious entity can inflict on the system should be as low as possible.
  • Decentralized: Names correctly resolve to their respective entities without the use of a central authority or service.

Discussed on

๐Ÿ”— Mpemba Effect

๐Ÿ”— Physics

The Mpemba effect is a process in which hot water can freeze faster than cold water. The phenomenon is temperature-dependent. There is disagreement about the parameters required to produce the effect and about its theoretical basis.

The Mpemba effect is named after Tanzanian scientist Erasto Bartholomeo Mpemba (b.1950) who discovered it in 1963. There were preceding ancient accounts of similar phenomena, but these lacked sufficient detail to attempt verification.

Discussed on

๐Ÿ”— Secretary Problem

๐Ÿ”— 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 n {\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 1 / e {\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 โˆผ n / e {\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 1 / e {\displaystyle 1/e} stopping rule, because the probability of stopping at the best applicant with this strategy is about 1 / e {\displaystyle 1/e} already for moderate values of n {\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.

Discussed on

๐Ÿ”— East Germany balloon escape

๐Ÿ”— Germany ๐Ÿ”— Socialism ๐Ÿ”— Cold War ๐Ÿ”— Germany/GDR

On 16 September 1979, eight people from two families escaped from East Germany by crossing the border into West Germany at night in a homemade hot air balloon. The unique feat was the result of over a year and a half of preparations involving three different balloons, various modifications, and a first, unsuccessful attempt. The failed attempt alerted the East German authorities to the plot, but the police were unable to identify the escapees before their second, successful flight two months later.

Discussed on

๐Ÿ”— Oblique Strategies

๐Ÿ”— Literature ๐Ÿ”— Psychology

Oblique Strategies (subtitled Over One Hundred Worthwhile Dilemmas) is a card-based method for promoting creativity jointly created by Brian Eno and Peter Schmidt, first published in 1975. Physically, it takes the form of a deck of 7-by-9-centimetre (2.8ย in ร—ย 3.5ย in) printed cards in a black box. Each card offers a challenging constraint intended to help artists (particularly musicians) break creative blocks by encouraging lateral thinking.

Discussed on

๐Ÿ”— Zero Rupee Note

๐Ÿ”— India ๐Ÿ”— Numismatics ๐Ÿ”— India/Indian politics workgroup

A zero-rupee note is a banknote imitation issued in India as a means of helping to fight systemic political corruption. The notes are "paid" in protest by angry citizens to government functionaries who solicit bribes in return for services which are supposed to be free. Zero rupee notes, which are made to resemble the regular 50 rupee banknote of India, are the creation of a non-governmental organization known as 5th Pillar which has, since their inception in 2007, distributed over 2.5 million notes as of August 2014. The notes remain in current use and thousands of notes are distributed every month.

Discussed on

๐Ÿ”— Lindy Effect

๐Ÿ”— Economics ๐Ÿ”— Sociology

The Lindy effect is a theory that the future life expectancy of some non-perishable things like a technology or an idea is proportional to their current age, so that every additional period of survival implies a longer remaining life expectancy. Where the Lindy effect applies, mortality rate decreases with time.

Discussed on