Have a deep view into what people are curious about.

🔗 Philosophy 🔗 Psychology

The illusory truth effect (also known as the validity effect, truth effect, or the reiteration effect) is the tendency to believe false information to be correct after repeated exposure. This phenomenon was first identified in a 1977 study at Villanova University and Temple University. When truth is assessed, people rely on whether the information is in line with their understanding or if it feels familiar. The first condition is logical, as people compare new information with what they already know to be true. Repetition makes statements easier to process relative to new, unrepeated statements, leading people to believe that the repeated conclusion is more truthful. The illusory truth effect has also been linked to "hindsight bias", in which the recollection of confidence is skewed after the truth has been received.

In a 2015 study, researchers discovered that familiarity can overpower rationality and that repetitively hearing that a certain fact is wrong can affect the hearer's beliefs. Researchers attributed the illusory truth effect's impact on participants who knew the correct answer to begin with, but were persuaded to believe otherwise through the repetition of a falsehood, to "processing fluency".

The illusory truth effect plays a significant role in such fields as election campaigns, advertising, news media, and political propaganda.

🔗 Economics 🔗 Business 🔗 Politics 🔗 Socialism 🔗 Sociology 🔗 Capitalism 🔗 Conservatism 🔗 Politics/Liberalism

Late capitalism, late-stage capitalism, or end-stage capitalism is a term first used in print by German economist Werner Sombart around the turn of the 20th century. In the late 2010s, the term began to be used in the United States and Canada to refer to perceived absurdities, contradictions, crises, injustices, inequality, and exploitation created by modern business development.

Later capitalism refers to the historical epoch since 1940, including the post–World War II economic expansion called the "golden age of capitalism". The expression already existed for a long time in continental Europe, before it gained popularity in the English-speaking world through the English translation of Ernest Mandel's book Late Capitalism, published in 1975.

The German original edition of Mandel's work was subtitled in "an attempt at an explanation", meaning that Mandel tried to provide an orthodox Marxist explanation of the post-war epoch in terms of Marx's theory of the capitalist mode of production. Mandel suggested that important qualitative changes occurred within the capitalist system during and after World War II and that there are limits to capitalist development.

🔗 Electronics

The two capacitor paradox or capacitor paradox is a paradox, or counterintuitive thought experiment, in electric circuit theory. The thought experiment is usually described as follows: Two identical capacitors are connected in parallel with an open switch between them. One of the capacitors is charged with a voltage of ${\displaystyle V_{i}}$, the other is uncharged. When the switch is closed, some of the charge ${\displaystyle Q=CV_{i}}$ on the first capacitor flows into the second, reducing the voltage on the first and increasing the voltage on the second. When a steady state is reached and the current goes to zero, the voltage on the two capacitors must be equal since they are connected together. Since they both have the same capacitance ${\displaystyle C}$ the charge will be divided equally between the capacitors so each capacitor will have a charge of ${\displaystyle {Q \over 2}}$ and a voltage of ${\displaystyle V_{f}={Q \over 2C}={V_{i} \over 2}}$. At the beginning of the experiment the total initial energy ${\displaystyle W_{i}}$ in the circuit is the energy stored in the charged capacitor:

${\displaystyle W_{i}={1 \over 2}CV_{i}^{2}}$.

At the end of the experiment the final energy ${\displaystyle W_{f}}$ is equal to the sum of the energy in the two capacitors

${\displaystyle W_{f}={1 \over 2}CV_{f}^{2}+{1 \over 2}CV_{f}^{2}=CV_{f}^{2}=C({V_{i} \over 2})^{2}={1 \over 4}CV_{i}^{2}={1 \over 2}W_{i}}$

Thus the final energy ${\displaystyle W_{f}}$ is equal to half of the initial energy ${\displaystyle W_{i}}$. Where did the other half of the initial energy go?

🔗 New York (state)

The Larkin Company, also known as the Larkin Soap Company, was a company founded in 1875 in Buffalo, New York as a small soap factory. It grew tremendously throughout the late 1800s and into the first quarter of the 1900s with an approach called "The Larkin Idea" that transformed the company into a mail-order conglomerate that employed 2,000 people and had annual sales of $28.6 million (equivalent to $434,986,000 in 2023) in 1920. The company's success allowed them to hire Frank Lloyd Wright to design the iconic Larkin Administration Building which stood as a symbol of Larkin prosperity until the company's demise in the 1940s.

🔗 Mathematics

The Karnaugh map (KM or K-map) is a method of simplifying Boolean algebra expressions. Maurice Karnaugh introduced it in 1953 as a refinement of Edward Veitch's 1952 Veitch chart, which actually was a rediscovery of Allan Marquand's 1881 logical diagram aka Marquand diagram but with a focus now set on its utility for switching circuits. Veitch charts are therefore also known as Marquand–Veitch diagrams, and Karnaugh maps as Karnaugh–Veitch maps (KV maps).

The Karnaugh map reduces the need for extensive calculations by taking advantage of humans' pattern-recognition capability. It also permits the rapid identification and elimination of potential race conditions.

The required Boolean results are transferred from a truth table onto a two-dimensional grid where, in Karnaugh maps, the cells are ordered in Gray code, and each cell position represents one combination of input conditions, while each cell value represents the corresponding output value. Optimal groups of 1s or 0s are identified, which represent the terms of a canonical form of the logic in the original truth table. These terms can be used to write a minimal Boolean expression representing the required logic.

Karnaugh maps are used to simplify real-world logic requirements so that they can be implemented using a minimum number of physical logic gates. A sum-of-products expression can always be implemented using AND gates feeding into an OR gate, and a product-of-sums expression leads to OR gates feeding an AND gate. Karnaugh maps can also be used to simplify logic expressions in software design. Boolean conditions, as used for example in conditional statements, can get very complicated, which makes the code difficult to read and to maintain. Once minimised, canonical sum-of-products and product-of-sums expressions can be implemented directly using AND and OR logic operators. Diagrammatic and mechanical methods for minimizing simple logic expressions have existed since at least the medieval times. More systematic methods for minimizing complex expressions began to be developed in the early 1950s, but until the mid to late 1980s the Karnaugh map was the most common used in practice.

🔗 Computer science 🔗 Mathematics 🔗 Systems 🔗 Cryptography 🔗 Cryptography/Computer science 🔗 Systems/Operations research

The knapsack problem is a problem in combinatorial optimization: Given a set of items, each with a weight and a value, determine the number of each item to include in a collection so that the total weight is less than or equal to a given limit and the total value is as large as possible. It derives its name from the problem faced by someone who is constrained by a fixed-size knapsack and must fill it with the most valuable items. The problem often arises in resource allocation where the decision makers have to choose from a set of non-divisible projects or tasks under a fixed budget or time constraint, respectively.

The knapsack problem has been studied for more than a century, with early works dating as far back as 1897. The name "knapsack problem" dates back to the early works of mathematician Tobias Dantzig (1884–1956), and refers to the commonplace problem of packing the most valuable or useful items without overloading the luggage.

🔗 France 🔗 Celts 🔗 Mythology

Ys (pronounced EESS), also spelled Is or Kêr-Is in Breton, and Ville d'Ys in French, is a mythical city on the coast of Brittany that was swallowed up by the ocean. Most versions of the legend place the city in the Baie de Douarnenez.

🔗 Biography 🔗 Computing 🔗 Biography/science and academia 🔗 Computing/Software 🔗 Computing/Free and open-source software 🔗 Computing/Amiga 🔗 Open

Fred Fish (November 4, 1952 – April 20, 2007) was a computer programmer notable for work on the GNU Debugger and his series of freeware disks for the Amiga.

The Amiga Library Disks – colloquially referred to as Fish Disks (a term coined by Perry Kivolowitz at a Jersey Amiga User Group meeting) – became the first national rallying point, a sort of early postal system. Fish would distribute his disks around the world in time for regional and local user group meetings, which in turn duplicated them for local distribution. Typically, only the cost of materials changed hands. The Fish Disk series ran from 1986 to 1994. In it, one can chart the growing sophistication of Amiga software and see the emergence of many software trends.

The Fish Disks were distributed at computer stores and Amiga enthusiast clubs. Contributors submitted applications and source code and the best of these each month were assembled and released as a diskette. Since the Internet was not yet in popular usage outside military and university circles, this was a primary way for enthusiasts to share work and ideas. He also initiated the "GeekGadgets" project, a GNU standard environment for AmigaOS and BeOS.

Fish worked for Cygnus Solutions in the 1990s before he left for Be Inc. in 1998.

In 1978, he self-published User Survival Guide for TI-58/59 Master Library, which was advertised in enthusiast newsletters covering the TI-59 programmable calculator.

🔗 Mathematics

In number theory, the Pólya conjecture stated that "most" (i.e., 50% or more) of the natural numbers less than any given number have an odd number of prime factors. The conjecture was posited by the Hungarian mathematician George Pólya in 1919, and proved false in 1958 by C. Brian Haselgrove.

The size of the smallest counterexample is often used to show how a conjecture can be true for many cases, and still be false, providing an illustration for the strong law of small numbers.

🔗 Computing 🔗 Systems 🔗 Business 🔗 Computing/Software 🔗 Computing/Computer science 🔗 Engineering 🔗 Systems/Systems engineering

Hofstadter's law is a self-referential adage, coined by Douglas Hofstadter in his book Gödel, Escher, Bach: An Eternal Golden Braid (1979) to describe the widely experienced difficulty of accurately estimating the time it will take to complete tasks of substantial complexity:

Hofstadter's Law: It always takes longer than you expect, even when you take into account Hofstadter's Law.

The law is often cited by programmers in discussions of techniques to improve productivity, such as The Mythical Man-Month or extreme programming.