HOME
*





Alexander Brudno
Alexander L'vovich Brudno (russian: Александр Львович Брудно) (10 January 1918 – 1 December 2009)
was a Russian computer scientist, best known for fully describing the . From 1991 until his death he lived in Israel.


Biography

Brudno developed the "mathematics/machine interface" for the
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Soviet Union
The Soviet Union,. officially the Union of Soviet Socialist Republics. (USSR),. was a List of former transcontinental countries#Since 1700, transcontinental country that spanned much of Eurasia from 1922 to 1991. A flagship communist state, it was nominally a Federation, federal union of Republics of the Soviet Union, fifteen national republics; in practice, both Government of the Soviet Union, its government and Economy of the Soviet Union, its economy were highly Soviet-type economic planning, centralized until its final years. It was a one-party state governed by the Communist Party of the Soviet Union, with the city of Moscow serving as its capital as well as that of its largest and most populous republic: the Russian Soviet Federative Socialist Republic, Russian SFSR. Other major cities included Saint Petersburg, Leningrad (Russian SFSR), Kyiv, Kiev (Ukrainian Soviet Socialist Republic, Ukrainian SSR), Minsk (Byelorussian Soviet Socialist Republic, Byelorussian SSR), Tas ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Alan Kotok
Alan Kotok (November 9, 1941 – May 26, 2006) was an American computer scientist known for his work at Digital Equipment Corporation (Digital, or DEC) and at the World Wide Web Consortium (W3C). Steven Levy, in his book '' Hackers: Heroes of the Computer Revolution'', describes Kotok and his classmates at the Massachusetts Institute of Technology (MIT) as the first true hackers. Kotok was a precocious child who skipped two grades before college. At MIT, he became a member of the Tech Model Railroad Club, and after enrolling in MIT's first freshman programming class, he helped develop some of the earliest computer software including a digital audio program and what is sometimes called the first video game (''Spacewar!''). Together with his teacher John McCarthy and other classmates, he was part of the team that wrote the Kotok-McCarthy program which took part in the first chess match between computers. After leaving MIT, Kotok joined the computer manufacturer Digital Equ ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Dartmouth Conference
The Dartmouth Conference is the longest continuous bilateral dialogue between American and Soviet (now Russian) representatives. The first Dartmouth Conference took place at Dartmouth College in 1961. Subsequent conferences were held through 1990. They were revived in 2014 and continue today. Task forces begun under the auspices of the main conference continued to work after the main conference stopped. The Regional Conflicts Task Force extended the sustained dialogue model, based on the Dartmouth experience, to conflicts in Tajikistan and Nagorno-Karabakh. Dartmouth inspired a number of other dialogues in the former Soviet Union and elsewhere, many of them under the auspices of the Sustained Dialogue Institute and the Kettering Foundation. Origin The Dartmouth Conference was begun by Norman Cousins, editor of the Saturday Review of Literature, and a founding member of the National Committee for a Sane Nuclear Policy (SANE). Speaking to the presidium of the Soviet Peace Committ ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


United States
The United States of America (U.S.A. or USA), commonly known as the United States (U.S. or US) or America, is a country primarily located in North America. It consists of 50 U.S. state, states, a Washington, D.C., federal district, five major unincorporated territories, nine United States Minor Outlying Islands, Minor Outlying Islands, and 326 Indian reservations. The United States is also in Compact of Free Association, free association with three Oceania, Pacific Island Sovereign state, sovereign states: the Federated States of Micronesia, the Marshall Islands, and the Palau, Republic of Palau. It is the world's List of countries and dependencies by area, third-largest country by both land and total area. It shares land borders Canada–United States border, with Canada to its north and Mexico–United States border, with Mexico to its south and has maritime borders with the Bahamas, Cuba, Russia, and other nations. With a population of over 333 million, it is the List of ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  




Arthur Samuel
Arthur Lee Samuel (December 5, 1901 – July 29, 1990) was an American pioneer in the field of computer gaming and artificial intelligence. He popularized the term "machine learning" in 1959. The Samuel Checkers-playing Program was among the world's first successful self-learning programs, and as such a very early demonstration of the fundamental concept of artificial intelligence (AI). He was also a senior member in the TeX community who devoted much time giving personal attention to the needs of users and wrote an early TeX manual in 1983. Biography Samuel was born on December 5, 1901, in Emporia, Kansas, and graduated from College of Emporia in Kansas in 1923. He received a master's degree in Electrical Engineering from MIT in 1926, and taught for two years as instructor. In 1928, he joined Bell Laboratories, where he worked mostly on vacuum tubes, including improvements of radar during World War II. He developed a gas-discharge transmit-receive switch (TR tube) that allo ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

John McCarthy (computer Scientist)
John McCarthy (September 4, 1927 – October 24, 2011) was an American computer scientist and cognitive scientist. He was one of the founders of the discipline of artificial intelligence. He co-authored the document that coined the term "artificial intelligence" (AI), developed the programming language family Lisp, significantly influenced the design of the language ALGOL, popularized time-sharing, and invented garbage collection. McCarthy spent most of his career at Stanford University. He received many accolades and honors, such as the 1971 Turing Award for his contributions to the topic of AI, the United States National Medal of Science, and the Kyoto Prize. Early life and education John McCarthy was born in Boston, Massachusetts, on September 4, 1927, to an Irish immigrant father and a Lithuanian Jewish immigrant mother, John Patrick and Ida (Glatt) McCarthy. The family was obliged to relocate frequently during the Great Depression, until McCarthy's father found wor ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Herbert A
Herbert may refer to: People Individuals * Herbert (musician), a pseudonym of Matthew Herbert Name * Herbert (given name) * Herbert (surname) Places Antarctica * Herbert Mountains, Coats Land * Herbert Sound, Graham Land Australia * Herbert, Northern Territory, a rural locality * Herbert, South Australia. former government town * Division of Herbert, an electoral district in Queensland * Herbert River, a river in Queensland * County of Herbert, a cadastral unit in South Australia Canada * Herbert, Saskatchewan, Canada, a town * Herbert Road, St. Albert, Canada New Zealand * Herbert, New Zealand, a town * Mount Herbert (New Zealand) United States * Herbert, Illinois, an unincorporated community * Herbert, Michigan, a former settlement * Herbert Creek, a stream in South Dakota * Herbert Island, Alaska Arts, entertainment, and media Fictional entities * Herbert (Disney character) * Herbert Pocket (''Great Expectations'' character), Pip's close friend and roommat ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Allen Newell
Allen Newell (March 19, 1927 – July 19, 1992) was a researcher in computer science and cognitive psychology at the RAND Corporation and at Carnegie Mellon University’s School of Computer Science, Tepper School of Business, and Department of Psychology. He contributed to the Information Processing Language (1956) and two of the earliest AI programs, the Logic Theory Machine (1956) and the General Problem Solver (1957) (with Herbert A. Simon). He was awarded the ACM's A.M. Turing Award along with Herbert A. Simon in 1975 for their basic contributions to artificial intelligence and the psychology of human cognition. Early studies Newell completed his Bachelor's degree in physics from Stanford in 1949. He was a graduate student at Princeton University from 1949–1950, where he did mathematics. Due to his early exposure to an unknown field known as game theory and the experiences from the study of mathematics, he was convinced that he would prefer a combination of ex ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Minimax
Minimax (sometimes MinMax, MM or saddle point) is a decision rule used in artificial intelligence, decision theory, game theory, statistics, and philosophy for ''mini''mizing the possible loss for a worst case (''max''imum loss) scenario. When dealing with gains, it is referred to as "maximin" – to maximize the minimum gain. Originally formulated for several-player zero-sum game theory, covering both the cases where players take alternate moves and those where they make simultaneous moves, it has also been extended to more complex games and to general decision-making in the presence of uncertainty. Game theory In general games The maximin value is the highest value that the player can be sure to get without knowing the actions of the other players; equivalently, it is the lowest value the other players can force the player to receive when they know the player's action. Its formal definition is: :\underline = \max_ \min_ Where: * is the index of the player of inte ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Method Of Four Russians
In computer science, the Method of Four Russians is a technique for speeding up algorithms involving Boolean matrices, or more generally algorithms involving matrices in which each cell may take on only a bounded number of possible values. Idea The main idea of the method is to partition the matrix into small square blocks of size for some parameter , and to use a lookup table to perform the algorithm quickly within each block. The index into the lookup table encodes the values of the matrix cells on the upper left of the block boundary prior to some operation of the algorithm, and the result of the lookup table encodes the values of the boundary cells on the lower right of the block after the operation. Thus, the overall algorithm may be performed by operating on only blocks instead of on matrix cells, where is the side length of the matrix. In order to keep the size of the lookup tables (and the time needed to initialize them) sufficiently small, is typically chosen to be ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]