Have a deep view into what people are curious about.

🔗 Neuroscience 🔗 Anatomy 🔗 Anatomy/Neuroanatomy

Yakovlevian torque (also known as occipital bending (OB) or counterclockwise brain torque) is the tendency of the right side of the human brain to be warped slightly forward relative to the left and the left side of the human brain to be warped slightly backward relative to the right. This is responsible for certain asymmetries, such as how the lateral sulcus of the human brain is often longer and less curved on the left side of the brain relative to the right. Stated in another way, Yakovlevian Torque can be defined by the existence of right-frontal and left-occipital petalias, which are protrusions of the surface of one hemisphere relative to the other. It is named for Paul Ivan Yakovlev (1894–1983), a Russian-American neuroanatomist from Harvard Medical School.

🔗 Birds

Wrens are a family, Troglodytidae, of small brown passerine birds. The family includes 96 species and is divided into 19 genera. All species are restricted to the New World except for the Eurasian wren that is widely distributed in the Old World. In Anglophone regions, the Eurasian wren is commonly known simply as the "wren", as it is the originator of the name. The name wren has been applied to other, unrelated birds, particularly the New Zealand wrens (Acanthisittidae) and the Australian wrens (Maluridae).

Most wrens are visually inconspicuous though they have loud and often complex songs. Exceptions include the relatively large members of the genus Campylorhynchus, which can be quite bold in their behaviour. Wrens have short wings that are barred in most species, and they often hold their tails upright. Wrens are primarily insectivorous, eating insects, spiders and other small invertebrates, but many species also eat vegetable matter and some eat small frogs and lizards.

🔗 United States/U.S. Government 🔗 United States 🔗 Law 🔗 Politics 🔗 Politics/American politics 🔗 Crime and Criminal Biography 🔗 United States/Presidents of the United States

Presidential immunity is the concept that sitting presidents of the United States have civil or criminal immunity for their official acts. Neither civil nor criminal immunity is explicitly granted in the Constitution or any federal statute. However, the Supreme Court of the United States ruled in Trump v. United States (2024) that all presidents have absolute criminal immunity for official acts under core constitutional powers, presumptive immunity for other official acts. The court held that there is no immunity for unofficial acts. The court made this decision after former President Trump claimed immunity from prosecution for actions performed within the perimeter of his responsibilities as president.

Previously, the Supreme Court had found in Nixon v. Fitzgerald (1982) that the president has absolute immunity from civil damages actions regarding conduct within the "outer perimeter" of their duties. However, in Clinton v. Jones (1997), the court ruled against temporary immunity for sitting presidents from suits arising from pre-presidency conduct. Some scholars suggested an immunity from arrest and criminal prosecution as well, a view which became the practice of the Department of Justice under a pair of memoranda (1973 and 2000) from the Office of Legal Counsel. Presidents Richard Nixon, Bill Clinton, and Donald Trump were criminally investigated while in office, but none were prosecuted while still in office.

🔗 Military history 🔗 Military history/North American military history 🔗 Military history/United States military history 🔗 Military history/Military science, technology, and theory

MOLLE (pronounced , similar in pronunciation to the name Molly) is an acronym for Modular Lightweight Load-carrying Equipment. It is used to define the current generation of load-bearing equipment and backpacks used by a number of NATO armed forces, especially the British Army and the United States Army.

The system's modularity is derived from the use of Pouch Attachment Ladder System (PALS) webbing equipment as rows of heavy-duty nylon stitched onto the vest to allow for the attachment of various compatible pouches and accessories. This method of attachment has become a de facto standard for modular tactical gear, replacing the All-purpose Lightweight Individual Carrying Equipment (ALICE) system used in the earliest modular vest systems (which is still in use with many police forces).

🔗 Philosophy 🔗 Philosophy/Logic 🔗 Philosophy/Epistemology

The theory of belief functions, also referred to as evidence theory or Dempster–Shafer theory (DST), is a general framework for reasoning with uncertainty, with understood connections to other frameworks such as probability, possibility and imprecise probability theories. First introduced by Arthur P. Dempster in the context of statistical inference, the theory was later developed by Glenn Shafer into a general framework for modeling epistemic uncertainty—a mathematical theory of evidence. The theory allows one to combine evidence from different sources and arrive at a degree of belief (represented by a mathematical object called belief function) that takes into account all the available evidence.

In a narrow sense, the term Dempster–Shafer theory refers to the original conception of the theory by Dempster and Shafer. However, it is more common to use the term in the wider sense of the same general approach, as adapted to specific kinds of situations. In particular, many authors have proposed different rules for combining evidence, often with a view to handling conflicts in evidence better. The early contributions have also been the starting points of many important developments, including the transferable belief model and the theory of hints.

🔗 Computer science

The Schönhage–Strassen algorithm is an asymptotically fast multiplication algorithm for large integers. It was developed by Arnold Schönhage and Volker Strassen in 1971. The run-time bit complexity is, in Big O notation, ${\displaystyle O(n\cdot \log n\cdot \log \log n)}$ for two n-digit numbers. The algorithm uses recursive fast Fourier transforms in rings with 2ⁿ+1 elements, a specific type of number theoretic transform.

The Schönhage–Strassen algorithm was the asymptotically fastest multiplication method known from 1971 until 2007, when a new method, Fürer's algorithm, was announced with lower asymptotic complexity; however, Fürer's algorithm currently only achieves an advantage for astronomically large values and is used only in Basic Polynomial Algebra Subprograms (BPAS) (see Galactic algorithms).

In practice the Schönhage–Strassen algorithm starts to outperform older methods such as Karatsuba and Toom–Cook multiplication for numbers beyond 2²¹⁵ to 2²¹⁷ (10,000 to 40,000 decimal digits). The GNU Multi-Precision Library uses it for values of at least 1728 to 7808 64-bit words (33,000 to 150,000 decimal digits), depending on architecture. There is a Java implementation of Schönhage–Strassen which uses it above 74,000 decimal digits.

Applications of the Schönhage–Strassen algorithm include mathematical empiricism, such as the Great Internet Mersenne Prime Search and computing approximations of π, as well as practical applications such as Kronecker substitution, in which multiplication of polynomials with integer coefficients can be efficiently reduced to large integer multiplication; this is used in practice by GMP-ECM for Lenstra elliptic curve factorization.

🔗 Russia 🔗 Russia/mass media in Russia 🔗 Politics 🔗 Media 🔗 Russia/politics and law of Russia

The firehose of falsehood, or firehosing, is a propaganda technique in which a large number of messages are broadcast rapidly, repetitively, and continuously over multiple channels (such as news and social media) without regard for truth or consistency. Since 2014, when it was successfully used by Russia during its annexation of Crimea, this model has been adopted by other governments and political movements around the world.

🔗 Internet culture

TSLAQ is a loose, international collective of largely anonymous short-sellers, skeptics, and researchers who openly criticize Tesla, Inc. and its CEO, Elon Musk. The group primarily organizes on Twitter, often using the $TSLAQ cashtag, and Reddit to coordinate efforts and share news, opinions, and analysis about the company and its stock. Edward Niedermeyer, in his book Ludicrous: The Unvarnished Story of Tesla Motors (2019), establishes the doxxing of Lawrence Fossi, a Seeking Alpha writer and Tesla short seller who uses the pseudonym Montana Skeptic, in July 2018 as the catalyst for the formation of TSLAQ. The group was the subject of a Real Vision video which included interviews with prominent members @TESLACharts and @Paul91701736.

TSLAQ highlights what they claim to be a variety of dangerous, deceptive, unlawful and fraudulent business practices by Tesla. Regular criticisms include knowingly selling Model S cars with a design flaw that could cause fires, reselling defective "lemon" cars, performing stealth recalls and requiring customers to sign non-disclosure agreements for "goodwill" repairs, issuing over-the-air updates to cover-up a fire risk in their batteries, publishing misleading safety statistics, delivering cars with lower-performance hardware than promised, taking months to issue customers refunds, and selling a Full Self-Driving package with the promise 1 million "robotaxis" by the end of 2020 despite the technology not yet being available. TSLAQ has also criticized Tesla and Musk for their attempts to intimidate and silence whistleblowers who have spoken out against the company. In addition, the group has highlighted Tesla's history of environmental violations, disregard for workers' safety, and Musk's excessive compensation package. As financial media producer Demetri Kofinas put it, TSLAQ believes Musk "to be a carnival barker running the biggest fraud in corporate America."

On occasion, TSLAQ has exchanged online verbal hostilities with Tesla fans and Elon Musk, who once tweeted with a prominent member and also tweeted personal information of another. While explicitly an online group, off-line activities performed by subgroups include aerial reconnaissance and on-the-ground observations of parking lots used by Tesla for storage.

🔗 Computing 🔗 Computer science

In computational complexity and optimization the no free lunch theorem is a result that states that for certain types of mathematical problems, the computational cost of finding a solution, averaged over all problems in the class, is the same for any solution method. The name alludes to the saying "no such thing as a free lunch", that is, no method offers a "short cut". This is under the assumption that the search space is a probability density function. It does not apply to the case where the search space has underlying structure (e.g., is a differentiable function) that can be exploited more efficiently (e.g., Newton's method in optimization) than random search or even has closed-form solutions (e.g., the extrema of a quadratic polynomial) that can be determined without search at all. For such probabilistic assumptions, the outputs of all procedures solving a particular type of problem are statistically identical. A colourful way of describing such a circumstance, introduced by David Wolpert and William G. Macready in connection with the problems of search and optimization, is to say that there is no free lunch. Wolpert had previously derived no free lunch theorems for machine learning (statistical inference). Before Wolpert's article was published, Cullen Schaffer independently proved a restricted version of one of Wolpert's theorems and used it to critique the current state of machine learning research on the problem of induction.

In the "no free lunch" metaphor, each "restaurant" (problem-solving procedure) has a "menu" associating each "lunch plate" (problem) with a "price" (the performance of the procedure in solving the problem). The menus of restaurants are identical except in one regard – the prices are shuffled from one restaurant to the next. For an omnivore who is as likely to order each plate as any other, the average cost of lunch does not depend on the choice of restaurant. But a vegan who goes to lunch regularly with a carnivore who seeks economy might pay a high average cost for lunch. To methodically reduce the average cost, one must use advance knowledge of a) what one will order and b) what the order will cost at various restaurants. That is, improvement of performance in problem-solving hinges on using prior information to match procedures to problems.

In formal terms, there is no free lunch when the probability distribution on problem instances is such that all problem solvers have identically distributed results. In the case of search, a problem instance in this context is a particular objective function, and a result is a sequence of values obtained in evaluation of candidate solutions in the domain of the function. For typical interpretations of results, search is an optimization process. There is no free lunch in search if and only if the distribution on objective functions is invariant under permutation of the space of candidate solutions. This condition does not hold precisely in practice, but an "(almost) no free lunch" theorem suggests that it holds approximately.

🔗 Computing 🔗 Computing/Software 🔗 Computing/Websites

VRML (Virtual Reality Modeling Language, pronounced vermal or by its initials, originally—before 1995—known as the Virtual Reality Markup Language) is a standard file format for representing 3-dimensional (3D) interactive vector graphics, designed particularly with the World Wide Web in mind. It has been superseded by X3D.