Communication complexityIn theoretical computer science, communication complexity studies the amount of communication required to solve a problem when the input to the problem is distributed among two or more parties. The study of communication complexity was first introduced by Andrew Yao in 1979, while studying the problem of computation distributed among several machines. The problem is usually stated as follows: two parties (traditionally called Alice and Bob) each receive a (potentially different) -bit string and .
Summary executionA summary execution is an execution in which a person is accused of a crime and immediately killed without the benefit of a full and fair trial. Executions as the result of summary justice (such as a drumhead court-martial) are sometimes included, but the term generally refers to capture, accusation, and execution all conducted within a very short period of time, and without any trial. Under international law, refusal to accept lawful surrender in combat and instead killing the person surrendering is also categorized as a summary execution (as well as murder).
First-move advantage in chessIn chess, there is a general consensus among players and theorists that the player who makes the first move (White) has an inherent advantage. Since 1851, compiled statistics support this view; White consistently slightly more often than Black, usually scoring between 52 and 56 percent. White's is about the same for tournament games between humans and games between computers; however, White's advantage is less significant in blitz games and games between lower-level players.
Computer GoComputer Go is the field of artificial intelligence (AI) dedicated to creating a computer program that plays the traditional board game Go. The field is sharply divided into two eras. Before 2015, the programs of the era were weak. The best efforts of the 1980s and 1990s produced only AIs that could be defeated by beginners, and AIs of the early 2000s were intermediate level at best. Professionals could defeat these programs even given handicaps of 10+ stones in favor of the AI.
Public executionA public execution is a form of capital punishment which "members of the general public may voluntarily attend." This definition excludes the presence of only a small number of witnesses called upon to assure executive accountability. The purpose of such displays has historically been to deter individuals from defying laws or authorities. Attendance at such events was historically encouraged and sometimes even mandatory. While today most countries regard public executions with distaste, they have been practiced at some point in history nearly everywhere.
Computer chessComputer chess includes both hardware (dedicated computers) and software capable of playing chess. Computer chess provides opportunities for players to practice even in the absence of human opponents, and also provides opportunities for analysis, entertainment and training. Computer chess applications that play at the level of a chess master or higher are available on hardware from supercomputers to smart phones. Standalone chess-playing machines are also available.
Atomic spiesAtomic spies or atom spies were people in the United States, the United Kingdom, and Canada who are known to have illicitly given information about nuclear weapons production or design to the Soviet Union during World War II and the early Cold War. Exactly what was given, and whether everyone on the list gave it, are still matters of some scholarly dispute. In some cases, some of the arrested suspects or government witnesses had given strong testimonies or confessions which they recanted later or said were fabricated.
Evaluation functionAn evaluation function, also known as a heuristic evaluation function or static evaluation function, is a function used by game-playing computer programs to estimate the value or goodness of a position (usually at a leaf or terminal node) in a game tree. Most of the time, the value is either a real number or a quantized integer, often in nths of the value of a playing piece such as a stone in go or a pawn in chess, where n may be tenths, hundredths or other convenient fraction, but sometimes, the value is an array of three values in the unit interval, representing the win, draw, and loss percentages of the position.
Side effect (computer science)In computer science, an operation, function or expression is said to have a side effect if it modifies some state variable value(s) outside its local environment, which is to say if it has any observable effect other than its primary effect of returning a value to the invoker of the operation. Example side effects include modifying a non-local variable, modifying a static local variable, modifying a mutable argument passed by reference, performing I/O or calling other functions with side-effects.
Financial transactionA financial transaction is an agreement, or communication, between a buyer and seller to exchange goods, services, or assets for payment. Any transaction involves a change in the status of the finances of two or more businesses or individuals. A financial transaction always involves one or more financial asset, most commonly money or another valuable item such as gold or silver. There are many types of financial transactions. The most common type, purchases, occur when a good, service, or other commodity is sold to a consumer in exchange for money.
