Random Articles

Have a deep view into what people are curious about.

πŸ”— RIP Rebecca Heineman

πŸ”— Biography πŸ”— California πŸ”— Video games πŸ”— Women πŸ”— Biography/sports and games πŸ”— California/Southern California πŸ”— California/Los Angeles area πŸ”— LGBTQ+ studies πŸ”— Video games/esports πŸ”— LGBTQ+ studies/LGBTQ+ Person

Rebecca Ann Heineman (October 30, 1963 – November 17, 2025) was an American video game designer and programmer. Heineman was a founder or co-founder of video game companies Interplay Productions, Logicware, Contraband Entertainment, and Olde SkΓΌΓΌl. She was the chief executive officer of Olde SkΓΌΓΌl from 2013 until her death in 2025.

Discussed on

πŸ”— Islands in lakes on islands in lakes on islands

πŸ”— Islands πŸ”— Lakes

A recursive island or lake is an island or lake that is itself within an island or lake.

πŸ”— PhotoDNA

πŸ”— Computing πŸ”— Computing/Software πŸ”— Computing/Computer Security πŸ”— Microsoft

PhotoDNA is a proprietary image-identification and content filtering technology widely used by online service providers.

Discussed on

πŸ”— Technical debt

πŸ”— Computing

Technical debt (also known as design debt or code debt, but can be also related to other technical endeavors) is a concept in software development that reflects the implied cost of additional rework caused by choosing an easy (limited) solution now instead of using a better approach that would take longer.

As with monetary debt, if technical debt is not repaid, it can accumulate 'interest', making it harder to implement changes. Unaddressed technical debt increases software entropy. Technical debt is not necessarily a bad thing, and sometimes (e.g., as a proof-of-concept) is required to move projects forward. On the other hand, some experts claim that the "technical debt" metaphor tends to minimize the impact, which results in insufficient prioritization of the necessary work to correct it.

As a change is started on a codebase, there is often the need to make other coordinated changes in other parts of the codebase or documentation. Changes required that are not completed are considered debt, and until paid, will incur interest on top of interest, making it cumbersome to build a project. Although the term is used in software development primarily, it can also be applied to other professions.

Discussed on

πŸ”— Isambard Kingdom Brunel

πŸ”— Biography πŸ”— London πŸ”— Trains πŸ”— Civil engineering πŸ”— Ships πŸ”— River Thames πŸ”— Wiltshire πŸ”— Hampshire πŸ”— Bristol πŸ”— Trains/UK Railways

Isambard Kingdom Brunel (; 9 April 1806 – 15 September 1859) was a British civil engineer who is considered "one of the most ingenious and prolific figures in engineering history", "one of the 19th-century engineering giants", and "one of the greatest figures of the Industrial Revolution, [who] changed the face of the English landscape with his groundbreaking designs and ingenious constructions". Brunel built dockyards, the Great Western Railway (GWR), a series of steamships including the first propeller-driven transatlantic steamship, and numerous important bridges and tunnels. His designs revolutionised public transport and modern engineering.

Though Brunel's projects were not always successful, they often contained innovative solutions to long-standing engineering problems. During his career, Brunel achieved many engineering firsts, including assisting in the building of the first tunnel under a navigable river and the development of SSΒ Great Britain, the first propeller-driven, ocean-going, iron ship, which, when launched in 1843, was the largest ship ever built.

On the GWR, Brunel set standards for a well-built railway, using careful surveys to minimise gradients and curves. This necessitated expensive construction techniques, new bridges, new viaducts, and the two-mile (3.2Β km) long Box Tunnel. One controversial feature was the wide gauge, a "broad gauge" of 7Β ftΒ 1⁄4Β in (2,140Β mm), instead of what was later to be known as "standard gauge" of 4Β ftΒ 8Β 1⁄2Β in (1,435Β mm). He astonished Britain by proposing to extend the GWR westward to North America by building steam-powered, iron-hulled ships. He designed and built three ships that revolutionised naval engineering: the SSΒ Great Western (1838), the SSΒ Great Britain (1843), and the SSΒ Great Eastern (1859).

In 2002, Brunel was placed second in a BBC public poll to determine the "100 Greatest Britons". In 2006, the bicentenary of his birth, a major programme of events celebrated his life and work under the name Brunel 200.

Discussed on

πŸ”— JScript

πŸ”— Computing πŸ”— Microsoft Windows πŸ”— Microsoft Windows/Computing πŸ”— Computing/Software πŸ”— Microsoft πŸ”— JavaScript πŸ”— Microsoft/.NET

JScript is Microsoft's dialect of the ECMAScript standard that is used in Microsoft's Internet Explorer.

JScript is implemented as an Active Scripting engine. This means that it can be "plugged in" to OLE Automation applications that support Active Scripting, such as Internet Explorer, Active Server Pages, and Windows Script Host. It also means such applications can use multiple Active Scripting languages, e.g., JScript, VBScript or PerlScript.

JScript was first supported in the Internet Explorer 3.0 browser released in August 1996. Its most recent version is JScript 9.0, included in Internet Explorer 9.

JScript 10.0 is a separate dialect, also known as JScript .NET, which adds several new features from the abandoned fourth edition of the ECMAScript standard. It must be compiled for .NET Framework version 2 or version 4, but static type annotations are optional.

Discussed on

πŸ”— Shor's algorythm

πŸ”— Mathematics πŸ”— Physics

Shor's algorithm is a polynomial-time quantum computer algorithm for integer factorization. Informally, it solves the following problem: Given an integer N {\displaystyle N} , find its prime factors. It was invented in 1994 by the American mathematician Peter Shor.

On a quantum computer, to factor an integer N {\displaystyle N} , Shor's algorithm runs in polynomial time (the time taken is polynomial in log ⁑ N {\displaystyle \log N} , the size of the integer given as input). Specifically, it takes quantum gates of order O ( ( log ⁑ N ) 2 ( log ⁑ log ⁑ N ) ( log ⁑ log ⁑ log ⁑ N ) ) {\displaystyle O\!\left((\log N)^{2}(\log \log N)(\log \log \log N)\right)} using fast multiplication, thus demonstrating that the integer-factorization problem can be efficiently solved on a quantum computer and is consequently in the complexity class BQP. This is almost exponentially faster than the most efficient known classical factoring algorithm, the general number field sieve, which works in sub-exponential time β€” O ( e 1.9 ( log ⁑ N ) 1 / 3 ( log ⁑ log ⁑ N ) 2 / 3 ) {\displaystyle O\!\left(e^{1.9(\log N)^{1/3}(\log \log N)^{2/3}}\right)} . The efficiency of Shor's algorithm is due to the efficiency of the quantum Fourier transform, and modular exponentiation by repeated squarings.

If a quantum computer with a sufficient number of qubits could operate without succumbing to quantum noise and other quantum-decoherence phenomena, then Shor's algorithm could be used to break public-key cryptography schemes, such as the widely used RSA scheme. RSA is based on the assumption that factoring large integers is computationally intractable. As far as is known, this assumption is valid for classical (non-quantum) computers; no classical algorithm is known that can factor integers in polynomial time. However, Shor's algorithm shows that factoring integers is efficient on an ideal quantum computer, so it may be feasible to defeat RSA by constructing a large quantum computer. It was also a powerful motivator for the design and construction of quantum computers, and for the study of new quantum-computer algorithms. It has also facilitated research on new cryptosystems that are secure from quantum computers, collectively called post-quantum cryptography.

In 2001, Shor's algorithm was demonstrated by a group at IBM, who factored 15 {\displaystyle 15} into 3 Γ— 5 {\displaystyle 3\times 5} , using an NMR implementation of a quantum computer with 7 {\displaystyle 7} qubits. After IBM's implementation, two independent groups implemented Shor's algorithm using photonic qubits, emphasizing that multi-qubit entanglement was observed when running the Shor's algorithm circuits. In 2012, the factorization of 15 {\displaystyle 15} was performed with solid-state qubits. Also, in 2012, the factorization of 21 {\displaystyle 21} was achieved, setting the record for the largest integer factored with Shor's algorithm.

Discussed on

πŸ”— Goodhart's Law

πŸ”— 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.

Discussed on

πŸ”— Mike the Headless Chicken

πŸ”— United States πŸ”— Birds πŸ”— United States/Colorado

Mike the Headless Chicken (April 20, 1945 – March 17, 1947), also known as Miracle Mike, was a Wyandotte chicken that lived for 18 months after his head had been cut off. Although the story was thought by many to be a hoax, the bird's owner took him to the University of Utah in Salt Lake City to establish the facts.

Discussed on

πŸ”— All American Five radio receivers

πŸ”— Electronics

The term All American Five (abbreviated AA5) is a colloquial name for mass-produced, superheterodyne radio receivers that used five vacuum tubes in their design. These radio sets were designed to receive amplitude modulation (AM) broadcasts in the medium wave band, and were manufactured in the United States from the mid-1930s until the early 1960s. By eliminating a power transformer, cost of the units was kept low; the same principle was later applied to television receivers. Variations in the design for lower cost, shortwave bands, better performance or special power supplies existed, although many sets used an identical set of vacuum tubes.

Discussed on