Have a deep view into what people are curious about.

This Help page is about Wikipedia books created on Wikipedia.

🔗 Mathematics 🔗 Economics 🔗 Politics 🔗 Game theory

In game theory, the Nash equilibrium, named after the mathematician John Forbes Nash Jr., is a proposed solution of a non-cooperative game involving two or more players in which each player is assumed to know the equilibrium strategies of the other players, and no player has anything to gain by changing only their own strategy.

In terms of game theory, if each player has chosen a strategy, and no player can benefit by changing strategies while the other players keep theirs unchanged, then the current set of strategy choices and their corresponding payoffs constitutes a Nash equilibrium.

Stated simply, Alice and Bob are in Nash equilibrium if Alice is making the best decision she can, taking into account Bob's decision while his decision remains unchanged, and Bob is making the best decision he can, taking into account Alice's decision while her decision remains unchanged. Likewise, a group of players are in Nash equilibrium if each one is making the best decision possible, taking into account the decisions of the others in the game as long as the other parties' decisions remain unchanged.

Nash showed that there is a Nash equilibrium for every finite game: see further the article on strategy.

🔗 Military history 🔗 Military history/Military science, technology, and theory

The Kearny fallout meter, or KFM, is an expedient radiation meter. It is designed such that someone with a normal mechanical ability would be able to construct it before or during a nuclear attack, using common household items.

The Kearny fallout meter was developed by Cresson Kearny from research performed at Oak Ridge National Laboratory and published in the civil defense manual Nuclear War Survival Skills (ISBN 0-942487-01-X). The plans were originally released in Oak Ridge National Laboratory publication ORNL-5040, The KFM, A Homemade Yet Accurate and Dependable Fallout Meter and have been formatted in a newsprint-ready layout so that they may be quickly printed with accurate dimensions in local newspapers. It must be built from a correctly scaled copy of the plans; photocopies and printouts of digital copies may not be to scale.

🔗 International relations 🔗 Technology 🔗 Internet 🔗 Computing 🔗 Computer science 🔗 Law 🔗 Business 🔗 Politics 🔗 Robotics 🔗 International relations/International law 🔗 Futures studies 🔗 European Union 🔗 Science Policy 🔗 Artificial Intelligence

The Artificial Intelligence Act (AI Act) is a European Union regulation concerning artificial intelligence (AI).

It establishes a common regulatory and legal framework for AI in the European Union (EU). Proposed by the European Commission on 21 April 2021, and then passed in the European Parliament on 13 March 2024, it was unanimously approved by the Council of the European Union on 21 May 2024. The Act creates a European Artificial Intelligence Board to promote national cooperation and ensure compliance with the regulation. Like the EU's General Data Protection Regulation, the Act can apply extraterritorially to providers from outside the EU, if they have users within the EU.

It covers all types of AI in a broad range of sectors; exceptions include AI systems used solely for military, national security, research and non-professional purposes. As a piece of product regulation, it would not confer rights on individuals, but would regulate the providers of AI systems and entities using AI in a professional context. The draft Act was revised following the rise in popularity of generative AI systems, such as ChatGPT, whose general-purpose capabilities did not fit the main framework. More restrictive regulations are planned for powerful generative AI systems with systemic impact.

The Act classifies AI applications by their risk of causing harm. There are four levels – unacceptable, high, limited, minimal – plus an additional category for general-purpose AI. Applications with unacceptable risks are banned. High-risk applications must comply with security, transparency and quality obligations and undergo conformity assessments. Limited-risk applications only have transparency obligations and those representing minimal risks are not regulated. For general-purpose AI, transparency requirements are imposed, with additional evaluations when there are high risks.

La Quadrature du Net (LQDN) stated that the adopted version of the AI Act would be ineffective, arguing that the role of self-regulation and exemptions in the act rendered it "largely incapable of standing in the way of the social, political and environmental damage linked to the proliferation of AI".

🔗 Plants 🔗 Psychoactive and Recreational Drugs 🔗 Altered States of Consciousness 🔗 South America

Ayahuasca is a South American (pan-Amazonian) psychoactive brew used both socially and as ceremonial spiritual medicine among the indigenous peoples of the Amazon basin. It is a psychedelic and entheogenic brew commonly made out of the Banisteriopsis caapi vine, the Psychotria viridis shrub or a substitute, and possibly other ingredients. A chemically similar preparation, sometimes called "pharmahuasca", can be prepared using N,N-Dimethyltryptamine (DMT) and a pharmaceutical monoamine oxidase inhibitor (MAOI), such as isocarboxazid. B. caapi contains several alkaloids that act as MAOIs, which are required for DMT to be orally active. Ayahuasca is prepared in a tea that, when consumed, causes an altered state of consciousness or "high", including visual hallucinations and altered perceptions of reality.

The other required ingredient is a plant that contains the primary psychoactive, DMT. This is usually the shrub P. viridis, but Diplopterys cabrerana may be used as a substitute. Other plant ingredients often or occasionally used in the production of ayahuasca include Justicia pectoralis, one of the Brugmansia (especially Brugmansia insignis and Brugmansia versicolor, or a hybrid breed) or Datura species, and mapacho (Nicotiana rustica).

🔗 Internet 🔗 China

50 Cent Party, 50 Cent Army and wumao ( WOO-mow) are terms for Internet commentators who are hired by the authorities of the People's Republic of China to manipulate public opinion and disseminate disinformation to the benefit of the governing Chinese Communist Party (CCP). It was created during the early phases of the Internet's rollout to the wider public in China.

The name is derived from the allegation that such commentators are paid RMB¥0.50 for every post. These commentators create comments or articles on popular Chinese social media networks that are intended to derail discussions which are critical of the CCP, promoting narratives that serve the government's interests and insulting or spreading misinformation about political opponents of the Chinese government, both domestic and abroad. Some of these commentators have labeled themselves ziganwu (Chinese: 自干五, short for 自带干粮的五毛, lit. 'wumao who bring their own dry rations'), claiming they are not paid by authorities and express their support for the Chinese government out of their own volition.

Authors of a paper published in 2017 in the American Political Science Review estimate that the Chinese government fabricates 488 million social media posts per year. In contrast to common assumptions, the 50 Cent Party consists mostly of paid bureaucrats who respond to government directives and rarely defend their government from criticism or engage in direct arguments because "... the goal of this massive secretive operation is instead to distract the public and change the subject." Around 80% of the analysed posts involve pro-China cheerleading with inspirational slogans, and 13% involve general praise and suggestions on governmental policies. Despite the common allegation of the commentators getting paid for their posts, the paper suggested there was "no evidence" that they are paid anything for their posts, instead being required to do so as a part of their official party duties.

Research by professors at Harvard, Stanford, and UC San Diego indicated a "massive secretive operation" to fill China's Internet with propaganda, and has resulted in some 488 million posts written by fake social media accounts, representing about 0.6% of the 80 billion posts generated on Chinese social media. To maximize their influence, such pro-government comments are made largely during times of intense online debate, and when online protests have a possibility of transforming into real life actions. The colloquial term wumao has also been used by some English speakers outside of China as an insult against people with perceived pro-CCP bias.

🔗 Chess 🔗 Hungary 🔗 Turkey

The Turk, also known as the Mechanical Turk or Automaton Chess Player (German: Schachtürke, "chess Turk"; Hungarian: A Török), was a fake chess-playing machine constructed in the late 18th century. From 1770 until its destruction by fire in 1854 it was exhibited by various owners as an automaton, though it was eventually revealed to be an elaborate hoax. Constructed and unveiled in 1770 by Wolfgang von Kempelen (Hungarian: Kempelen Farkas; 1734–1804) to impress the Empress Maria Theresa of Austria, the mechanism appeared to be able to play a strong game of chess against a human opponent, as well as perform the knight's tour, a puzzle that requires the player to move a knight to occupy every square of a chessboard exactly once.

The Turk was in fact a mechanical illusion that allowed a human chess master hiding inside to operate the machine. With a skilled operator, the Turk won most of the games played during its demonstrations around Europe and the Americas for nearly 84 years, playing and defeating many challengers including statesmen such as Napoleon Bonaparte and Benjamin Franklin. The device was later purchased in 1804 and exhibited by Johann Nepomuk Mälzel. The chess masters who secretly operated it included Johann Allgaier, Boncourt, Aaron Alexandre, William Lewis, Jacques Mouret, and William Schlumberger, but the operators within the mechanism during Kempelen's original tour remain a mystery.

🔗 Greece 🔗 Writing systems

Boustrophedon (Ancient Greek: βουστροφηδόν, boustrophēdón "ox-turning" from βοῦς, bous, "ox", στροφή, strophē, "turn" and the adverbial suffix -δόν, "like, in the manner of"; that is, turning like oxen in ploughing) is a type of bi-directional text, mostly seen in ancient manuscripts and other inscriptions. Alternate lines of writing are flipped, or reversed, with reversed letters. Rather than going left-to-right as in modern European languages, or right-to-left as in Arabic and Hebrew, alternate lines in boustrophedon must be read in opposite directions. Also, the individual characters are reversed, or mirrored. It was a common way of writing in stone in Ancient Greece.

🔗 Computer science

Pearson hashing is a hash function designed for fast execution on processors with 8-bit registers. Given an input consisting of any number of bytes, it produces as output a single byte that is strongly dependent on every byte of the input. Its implementation requires only a few instructions, plus a 256-byte lookup table containing a permutation of the values 0 through 255.

This hash function is a CBC-MAC that uses an 8-bit substitution cipher implemented via the substitution table. An 8-bit cipher has negligible cryptographic security, so the Pearson hash function is not cryptographically strong, but it is useful for implementing hash tables or as a data integrity check code, for which purposes it offers these benefits:

• It is extremely simple.
• It executes quickly on resource-limited processors.
• There is no simple class of inputs for which collisions (identical outputs) are especially likely.
• Given a small, privileged set of inputs (e.g., reserved words for a compiler), the permutation table can be adjusted so that those inputs yield distinct hash values, producing what is called a perfect hash function.
• Two input strings differing by exactly one character never collide. E.g., applying the algorithm on the strings ABC and AEC will never produce the same value.

One of its drawbacks when compared with other hashing algorithms designed for 8-bit processors is the suggested 256 byte lookup table, which can be prohibitively large for a small microcontroller with a program memory size on the order of hundreds of bytes. A workaround to this is to use a simple permutation function instead of a table stored in program memory. However, using a too simple function, such as T[i] = 255-i, partly defeats the usability as a hash function as anagrams will result in the same hash value; using a too complex function, on the other hand, will affect speed negatively. Using a function rather than a table also allows extending the block size. Such functions naturally have to be bijective, like their table variants.

The algorithm can be described by the following pseudocode, which computes the hash of message C using the permutation table T:

algorithm pearson hashing is
    h := 0

    for each c in C loop
        h := T[ h xor c ]
    end loop

    return h

The hash variable (h) may be initialized differently, e.g. to the length of the data (C) modulo 256; this particular choice is used in the Python implementation example below.

🔗 Computing

The Andrew File System (AFS) is a distributed file system which uses a set of trusted servers to present a homogeneous, location-transparent file name space to all the client workstations. It was developed by Carnegie Mellon University as part of the Andrew Project. Originally named "Vice", "Andrew" refers to Andrew Carnegie and Andrew Mellon. Its primary use is in distributed computing.