Random Articles (Page 2)

Have a deep view into what people are curious about.

πŸ”— Turgot Map of Paris

πŸ”— France πŸ”— Maps

The Turgot map of Paris (French: Plan de Turgot) is a highly accurate and detailed map of the city of Paris, France, as it existed in the 1730s. The map was commissioned by Parisian municipality chief Michel-Γ‰tienne Turgot, drawn up by surveyor Louis Bretez, and engraved by Claude Lucas.

Discussed on

πŸ”— Hallucinogenic Fish

πŸ”— Fishes πŸ”— Psychoactive and Recreational Drugs πŸ”— Altered States of Consciousness

Several species of fish are claimed to produce hallucinogenic effects when consumed. For example, Sarpa salpa, a species of sea bream, is commonly claimed to be hallucinogenic. These widely distributed coastal fish are normally found in the Mediterranean and around Spain, and along the west and south coasts of Africa. Occasionally they are found in British waters. They may induce hallucinogenic effects that are purportedly LSD-like if eaten. In 2006, two men who apparently ate the fish experienced hallucinations lasting for several days. The likelihood of hallucinations depends on the season. Sarpa salpa is known as "the fish that makes dreams" in Arabic.

Other species claimed to be capable of producing hallucinations include several species of sea chub from the genus Kyphosus. It is unclear whether the toxins are produced by the fish themselves or by marine algae in their diet. Other hallucinogenic fish are Siganus spinus, called "the fish that inebriates" in Reunion Island, and Mulloidichthys flavolineatus (formerly Mulloidichthys samoensis), called "the chief of ghosts" in Hawaii.

Discussed on

πŸ”— Leary–Lettvin Debate

πŸ”— United States

The Leary–Lettvin debate was a May 3, 1967 debate between Dr. Jerome Lettvin, a medical doctor and professor at MIT, and Dr. Timothy Leary, a licensed psychologist, about the merits and dangers of the hallucinogenic drug LSD. It took place in the Kresge Auditorium at the Massachusetts Institute of Technology.

Discussed on

πŸ”— The Birthday Paradox

πŸ”— Mathematics πŸ”— Statistics

In probability theory, the birthday problem or birthday paradox concerns the probability that, in a set of n randomly chosen people, some pair of them will have the same birthday. By the pigeonhole principle, the probability reaches 100% when the number of people reaches 367 (since there are only 366 possible birthdays, including February 29). However, 99.9% probability is reached with just 70 people, and 50% probability with 23 people. These conclusions are based on the assumption that each day of the year (excluding February 29) is equally probable for a birthday.

Actual birth records show that different numbers of people are born on different days. In this case, it can be shown that the number of people required to reach the 50% threshold is 23 or fewer. For example, if half the people were born on one day and the other half on another day, then any two people would have a 50% chance of sharing a birthday.

It may well seem surprising that a group of just 23 individuals is required to reach a probability of 50% that at least two individuals in the group have the same birthday: this result is perhaps made more plausible by considering that the comparisons of birthday will actually be made between every possible pair of individuals = 23Β Γ—Β 22/2Β =Β 253 comparisons, which is well over half the number of days in a year (183 at most), as opposed to fixing on one individual and comparing his or her birthday to everyone else's. The birthday problem is not a "paradox" in the literal logical sense of being self-contradictory, but is merely unintuitive at first glance.

Real-world applications for the birthday problem include a cryptographic attack called the birthday attack, which uses this probabilistic model to reduce the complexity of finding a collision for a hash function, as well as calculating the approximate risk of a hash collision existing within the hashes of a given size of population.

The history of the problem is obscure. W. W. Rouse Ball indicated (without citation) that it was first discussed by Harold Davenport. However, Richard von Mises proposed an earlier version of what is considered today to be the birthday problem.

Discussed on

πŸ”— Pyongyang (Restaurant Chain)

πŸ”— Companies πŸ”— Korea πŸ”— Food and drink πŸ”— Korea/North Korea

Pyongyang (Chosongul: 평양관) is a restaurant chain named after the capital of North Korea, with around 130 locations worldwide. The restaurants are owned and operated by the Haedanghwa Group, an organization of the government of North Korea.

Discussed on

πŸ”— The Clever Hans Effect

πŸ”— Skepticism πŸ”— Psychology πŸ”— Equine

Clever Hans (in German: der Kluge Hans) was an Orlov Trotter horse that was claimed to have performed arithmetic and other intellectual tasks.

After a formal investigation in 1907, psychologist Oskar Pfungst demonstrated that the horse was not actually performing these mental tasks, but was watching the reactions of his trainer. He discovered this artifact in the research methodology, wherein the horse was responding directly to involuntary cues in the body language of the human trainer, who had the faculties to solve each problem. The trainer was entirely unaware that he was providing such cues. In honour of Pfungst's study, the anomalous artifact has since been referred to as the Clever Hans effect and has continued to be important knowledge in the observer-expectancy effect and later studies in animal cognition. Pfungst was an assistant to German philosopher and psychologist Carl Stumpf, who incorporated the experience with Hans into his further work on animal psychology and his ideas on phenomenology.

Discussed on

πŸ”— Why the Z boson had a different mass at different times of day.

πŸ”— Physics

The Large Electron–Positron Collider (LEP) was one of the largest particle accelerators ever constructed.

It was built at CERN, a multi-national centre for research in nuclear and particle physics near Geneva, Switzerland. LEP collided electrons with positrons at energies that reached 209 GeV. It was a circular collider with a circumference of 27 kilometres built in a tunnel roughly 100Β m (300Β ft) underground and passing through Switzerland and France. LEP was used from 1989 until 2000. Around 2001 it was dismantled to make way for the Large Hadron Collider, which re-used the LEP tunnel. To date, LEP is the most powerful accelerator of leptons ever built.

Discussed on

πŸ”— Tide-Predicting Machine No. 2

πŸ”— Oceans

Tide-Predicting Machine No. 2, also known as Old Brass Brains, was a special-purpose mechanical computer that uses gears, pulleys, chains, and other mechanical components to compute the height and time of high and low tides for specific locations. The machine can perform tide calculations much faster than a person could do with pencil and paper. The U.S. Coast and Geodetic Survey put the machine into operation in 1910. It was used until 1965, when it was replaced by an electronic computer.

Discussed on

πŸ”— Hashlife

πŸ”— Computer science

Hashlife is a memoized algorithm for computing the long-term fate of a given starting configuration in Conway's Game of Life and related cellular automata, much more quickly than would be possible using alternative algorithms that simulate each time step of each cell of the automaton. The algorithm was first described by Bill Gosper in the early 1980s while he was engaged in research at the Xerox Palo Alto Research Center. Hashlife was originally implemented on Symbolics Lisp machines with the aid of the Flavors extension.

Discussed on

πŸ”— Decimal Time

πŸ”— Astronomy πŸ”— Time

Decimal time is the representation of the time of day using units which are decimally related. This term is often used specifically to refer to the French Republican calendar time system used in France from 1794 to 1800, during the French Revolution, which divided the day into 10 decimal hours, each decimal hour into 100 decimal minutes and each decimal minute into 100 decimal seconds (100000 decimal seconds per day), as opposed to the more familiar standard time, which divides the day into 24 hours, each hour into 60 minutes and each minute into 60 seconds (86400 SI seconds per day).

The main advantage of a decimal time system is that, since the base used to divide the time is the same as the one used to represent it, the representation of hours, minutes and seconds can be handled as a unified value. Therefore, it becomes simpler to interpret a timestamp and to perform conversions. For instance, 1h23m45s is 1 decimal hour, 23 decimal minutes, and 45 decimal seconds, or 1.2345 decimal hours, or 123.45 decimal minutes or 12345 decimal seconds; 3 hours is 300 minutes or 30,000 seconds. This property also makes it straightforward to represent a timestamp as a fractional day, so that 2024-01-15.54321 can be interpreted as five decimal hours and 43 decimal minutes and 21 decimal seconds after the start of that day, or a fraction of 0.54321 (54.321%) through that day (which is shortly after traditional 13:00). It also adjusts well to digital time representation using epochs, in that the internal time representation can be used directly both for computation and for user-facing display.

Discussed on