Random Articles (Page 4)

Have a deep view into what people are curious about.

πŸ”— Lehmer sieve

πŸ”— Computing πŸ”— Computing/Early computers

Lehmer sieves are mechanical devices that implement sieves in number theory. Lehmer sieves are named for Derrick Norman Lehmer and his son Derrick Henry Lehmer. The father was a professor of mathematics at the University of California, Berkeley at the time, and his son followed in his footsteps as a number theorist and professor at Berkeley.

A sieve in general is intended to find the numbers which are remainders when a set of numbers are divided by a second set. Generally, they are used in finding solutions of Diophantine equations or to factor numbers. A Lehmer sieve will signal that such solutions are found in a variety of ways depending on the particular construction.

Discussed on

πŸ”— Neutral Monism

πŸ”— Philosophy πŸ”— Philosophy/Philosophy of religion πŸ”— Philosophy/Philosophy of mind πŸ”— Philosophy/Metaphysics

Neutral monism is an umbrella term for a class of metaphysical theories in the philosophy of mind, concerning the relation of mind to matter. These theories take the fundamental nature of reality to be neither mental nor physical; in other words it is "neutral".

Neutral monism has gained prominence as a potential solution to theoretical issues within the philosophy of mind, specifically the mind–body problem and the hard problem of consciousness. The mind–body problem is the problem of explaining how mind relates to matter. The hard problem is a related philosophical problem targeted at physicalist theories of mind specifically: the problem arises because it is not obvious how a purely physical universe could give rise to conscious experience. This is because physical explanations are mechanistic: that is, they explain phenomena by appealing to underlying functions and structures. And, though explanations of this sort seem to work well for a wide variety of phenomena, conscious experience seems uniquely resistant to functional explanations. As the philosopher David Chalmers has put it: "even when we have explained the performance of all the cognitive and behavioral functions in the vicinity of experience - perceptual discrimination, categorization, internal access, verbal report - there may still remain a further unanswered question: Why is the performance of these functions accompanied by experience?" The hard problem has motivated Chalmers and other philosophers to abandon the project of explaining consciousness in terms physical or chemical mechanisms (only 56.5% of philosophers are physicalists, according to the most recent PhilPapers survey).

With this, there has been growing demand for alternative ontologies (such as neutral monism) that may provide explanatory frameworks more suitable for explaining the existence of consciousness. It has been accepted by several prominent English-speaking philosophers, such as William James and Bertrand Russell.

Discussed on

πŸ”— Monty Hall Problem

πŸ”— Mathematics πŸ”— Television πŸ”— Statistics πŸ”— Game theory πŸ”— Television/Television game shows

The Monty Hall problem is a brain teaser, in the form of a probability puzzle, loosely based on the American television game show Let's Make a Deal and named after its original host, Monty Hall. The problem was originally posed (and solved) in a letter by Steve Selvin to the American Statistician in 1975 (Selvin 1975a), (Selvin 1975b). It became famous as a question from a reader's letter quoted in Marilyn vos Savant's "Ask Marilyn" column in Parade magazine in 1990 (vos Savant 1990a):

Suppose you're on a game show, and you're given the choice of three doors: Behind one door is a car; behind the others, goats. You pick a door, say No. 1, and the host, who knows what's behind the doors, opens another door, say No. 3, which has a goat. He then says to you, "Do you want to pick door No. 2?" Is it to your advantage to switch your choice?

Vos Savant's response was that the contestant should switch to the other door (vos Savant 1990a). Under the standard assumptions, contestants who switch have a 2/3 chance of winning the car, while contestants who stick to their initial choice have only a 1/3 chance.

The given probabilities depend on specific assumptions about how the host and contestant choose their doors. A key insight is that, under these standard conditions, there is more information about doors 2 and 3 than was available at the beginning of the game when door 1 was chosen by the player: the host's deliberate action adds value to the door he did not choose to eliminate, but not to the one chosen by the contestant originally. Another insight is that switching doors is a different action than choosing between the two remaining doors at random, as the first action uses the previous information and the latter does not. Other possible behaviors than the one described can reveal different additional information, or none at all, and yield different probabilities. Yet another insight is that your chance of winning by switching doors is directly related to your chance of choosing the winning door in the first place: if you choose the correct door on your first try, then switching loses; if you choose a wrong door on your first try, then switching wins; your chance of choosing the correct door on your first try is 1/3, and the chance of choosing a wrong door is 2/3.

Many readers of vos Savant's column refused to believe switching is beneficial despite her explanation. After the problem appeared in Parade, approximately 10,000 readers, including nearly 1,000 with PhDs, wrote to the magazine, most of them claiming vos Savant was wrong (Tierney 1991). Even when given explanations, simulations, and formal mathematical proofs, many people still do not accept that switching is the best strategy (vos Savant 1991a). Paul ErdΕ‘s, one of the most prolific mathematicians in history, remained unconvinced until he was shown a computer simulation demonstrating vos Savant’s predicted result (Vazsonyi 1999).

The problem is a paradox of the veridical type, because the correct choice (that one should switch doors) is so counterintuitive it can seem absurd, but is nevertheless demonstrably true. The Monty Hall problem is mathematically closely related to the earlier Three Prisoners problem and to the much older Bertrand's box paradox.

Discussed on

πŸ”— St. Cuthbert's Beads

πŸ”— Palaeontology πŸ”— Animals

St. Cuthbert's beads (or Cuddy's beads) are fossilised portions of the "stems" of crinoids from the Carboniferous period. Crinoids are a kind of marine echinoderm which are still extant, and which are sometimes known as "sea lilies". These bead-like fossils are washed out onto the beach and in medieval Northumberland were strung together as necklaces or rosaries, and became associated with St Cuthbert.

In other parts of England, circular crinoid columnals were known as "fairy money." Pentagonal crinoid columnals were known as "star stones", and moulds of the stems left impressions which were known as screwstones. In Germany, the columnals were known as Bonifatius pfennige (St Boniface's pennies) and in America they are known as Indian beads.

Discussed on

πŸ”— Unexpected hanging paradox

πŸ”— Philosophy πŸ”— Philosophy/Logic πŸ”— Philosophy/Epistemology

The unexpected hanging paradox or hangman paradox is a paradox about a person's expectations about the timing of a future event which they are told will occur at an unexpected time. The paradox is variously applied to a prisoner's hanging, or a surprise school test. It could be reduced to be Moore's paradox.

Despite significant academic interest, there is no consensus on its precise nature and consequently a final correct resolution has not yet been established. Logical analysis suggests that the problem arises in a self-contradictory self-referencing statement at the heart of the judge's sentence. Epistemological studies of the paradox have suggested that it turns on our concept of knowledge. Even though it is apparently simple, the paradox's underlying complexities have even led to its being called a "significant problem" for philosophy.

Discussed on

πŸ”— Indian Citizenship Act of 1924

πŸ”— United States πŸ”— Law πŸ”— Indigenous peoples of North America

The Indian Citizenship Act of 1924, (43Β Stat.Β 253, enacted June 2, 1924) was an Act of the United States Congress that granted US citizenship to the indigenous peoples of the United States. While the Fourteenth Amendment to the United States Constitution defines a citizen as any persons born in the United States and subject to its laws and jurisdiction, the amendment had previously been interpreted by the courts not to apply to Native peoples.

The act was proposed by Representative Homer P. Snyder (R-NY), and signed into law by President Calvin Coolidge on June 2, 1924. It was enacted partially in recognition of the thousands of Native Americans who served in the armed forces during the First World War.

Discussed on

πŸ”— SWEET16: Interpreted byte-code instruction set invented by Steve Wozniak

πŸ”— Apple Inc.

SWEET16 is an interpreted byte-code instruction set invented by Steve Wozniak and implemented as part of the Integer BASIC ROM in the Apple II series of computers. It was created because Wozniak needed to manipulate 16-bit pointer data, and the Apple II was an 8-bit computer.

SWEET16 was not used by the core BASIC code, but was later used to implement several utilities. Notable among these was the line renumbering routine, which was included in the Programmer's Aid #1 ROM, added to later Apple II models and available for user installation on earlier examples.

SWEET16 code is executed as if it were running on a 16-bit processor with sixteen internal 16-bit little-endian registers, named R0 through R15. Some registers have well-defined functions:

  • R0 – accumulator
  • R12 – subroutine stack pointer
  • R13 – stores the result of all comparison operations for branch testing
  • R14 – status register
  • R15 – program counter

The 16 virtual registers, 32 bytes in total, are located in the zero page of the Apple II's real, physical memory map (at $00–$1F), with values stored as low byte followed by high byte. The SWEET16 interpreter itself is located from $F689 to $F7FC in the Integer BASIC ROM.

According to Wozniak, the SWEET16 implementation is a model of frugal coding, taking up only about 300 bytes in memory. SWEET16 runs at about one-tenth the speed of the equivalent native 6502 code.

πŸ”— Singing Sand

πŸ”— Physics πŸ”— Geology πŸ”— Physics/Acoustics

Singing sand, also called whistling sand, barking sand or singing dune, is sand that produces sound. The sound emission may be caused by wind passing over dunes or by walking on the sand.

Certain conditions have to come together to create singing sand:

  1. The sand grains have to be round and between 0.1 and 0.5Β mm in diameter.
  2. The sand has to contain silica.
  3. The sand needs to be at a certain humidity.

The most common frequency emitted seems to be close to 450 Hz.

There are various theories about the singing sand mechanism. It has been proposed that the sound frequency is controlled by the shear rate. Others have suggested that the frequency of vibration is related to the thickness of the dry surface layer of sand. The sound waves bounce back and forth between the surface of the dune and the surface of the moist layer, creating a resonance that increases the sound's volume. The noise may be generated by friction between the grains or by the compression of air between them.

Other sounds that can be emitted by sand have been described as "roaring" or "booming".

πŸ”— Odeillo solar furnace

The Odeillo solar furnace is the world's largest solar furnace. It is situated in Font-Romeu-Odeillo-Via, in the department of PyrΓ©nΓ©es-Orientales, in south of France. It is 54 metres (177Β ft) high and 48 metres (157Β ft) wide, and includes 63 heliostats. It was built between 1962 and 1968, and started operating in 1969, and has a power of one megawatt.

It serves as a science research site studying materials at very high temperatures.

Discussed on