|
Donald B. Gillies
Donald Bruce Gillies (October 15, 1928 – July 17, 1975) was a Canadian computer scientist and mathematician who worked in the fields of computer design, game theory, and minicomputer programming environments. Early life and education Donald B. Gillies was born in Toronto, Ontario, Canada, to John Zachariah Gillies (a Canadian) and Anne Isabelle Douglas MacQueen (an American). He attended the University of Toronto Schools, a laboratory school originally affiliated with the university. Gillies completed his undergraduate degree at the University of Toronto. He began his graduate education at the University of Illinois and helped with the checkout of ORDVAC computer in the summer of 1951. After one year he transferred to Princeton to work for John von Neumann and developed the first theorems of core (game theory) in his PhD thesis. Gillies ranked among the top ten participants in the William Lowell Putnam Mathematical Competition held in 1950. Career Gillies moved ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Toronto, Ontario
Toronto ( , locally pronounced or ) is the List of the largest municipalities in Canada by population, most populous city in Canada. It is the capital city of the Provinces and territories of Canada, Canadian province of Ontario. With a population of 2,794,356 in 2021, it is the List of North American cities by population, fourth-most populous city in North America. The city is the anchor of the Golden Horseshoe, an urban agglomeration of 9,765,188 people (as of 2021) surrounding the western end of Lake Ontario, while the Greater Toronto Area proper had a 2021 population of 6,712,341. As of 2024, the census metropolitan area had an estimated population of 7,106,379. Toronto is an international centre of business, finance, arts, sports, and culture, and is recognized as one of the most multiculturalism, multicultural and cosmopolitanism, cosmopolitan cities in the world. Indigenous peoples in Canada, Indigenous peoples have travelled through and inhabited the Toronto area, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Core (game Theory)
In cooperative game theory, the core is the set of feasible allocations or imputations where no coalition of agents can benefit by breaking away from the grand coalition. An allocation is said to be in the ''core'' of a game if there is no coalition that can improve upon it. The core is then the set of all feasible allocations. Origin The idea of the core already appeared in the writings of , at the time referred to as the ''contract curve''. Even though von Neumann and Morgenstern considered it an interesting concept, they only worked with zero-sum games where the core is always empty. The modern definition of the core is due to Gillies. Definition Consider a transferable utility cooperative game (N,v) where N denotes the set of players and v is the characteristic function. An imputation x\in\mathbb^N is ''dominated'' by another imputation y if there exists a coalition C, such that each player in C weakly-prefers y (x_i\leq y_i for all i\in C) and there exists i\in ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
1928 Births
Events January * January – British bacteriologist Frederick Griffith reports the results of Griffith's experiment, indirectly demonstrating that DNA is the genetic material. * January 1 – Eastern Bloc emigration and defection: Boris Bazhanov, Joseph Stalin's personal secretary, crosses the border to Iran to defect from the Soviet Union. * January 17 – The OGPU arrests Leon Trotsky in Moscow; he assumes a status of passive resistance and is exiled with his family. * January 26 – The volcanic island Anak Krakatau appears. February * February – The Ford River Rouge Complex at Dearborn, Michigan, an automobile plant begun in 1917, is completed as the world's largest integrated factory. * February 8 – Scottish-born inventor John Logie Baird broadcasts a transatlantic television signal from London to Hartsdale, New York. * February 11 – February 19, 19 – The 1928 Winter Olympics are held in St. Moritz, Switzerland, the first as a separate event. Sonja Henie of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Largest Known Prime Number
The largest known prime number is , a number which has 41,024,320 digits when written in the decimal system. It was found on October 12, 2024, on a cloud-based virtual machine volunteered by Luke Durant, a 36-year-old researcher from San Jose, California, to the Great Internet Mersenne Prime Search (GIMPS). A prime number is a natural number greater than 1 with no divisors other than 1 and itself. Euclid's theorem proves that for any given prime number, there will always be a higher one, and thus there are infinitely many; there is no largest prime. Many of the largest known primes are Mersenne primes, numbers that are one less than a power of two, because they can utilize a Lucas–Lehmer primality test, specialized primality test that is faster than the general one. , the seven largest known primes are Mersenne primes. The last eighteen record primes were Mersenne primes. The Binary number, binary representation of any Mersenne prime is Repunit, composed of all ones, since the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
History Of Computing
The history of computing is longer than the history of computing hardware and modern computing technology and includes the history of methods intended for pen and paper or for chalk and slate, with or without the aid of tables. Concrete devices Digital computing is intimately tied to the representation of number A number is a mathematical object used to count, measure, and label. The most basic examples are the natural numbers 1, 2, 3, 4, and so forth. Numbers can be represented in language with number words. More universally, individual numbers can ...s. But long before abstractions like ''the number'' arose, there were mathematical concepts to serve the purposes of civilization. These concepts are implicit in concrete practices such as: *''Bijection, One-to-one correspondence'', a rule to counting, count ''how many'' items, e.g. on a tally stick, eventually abstracted into ''numbers''. *''Comparison to a standard'', a method for assuming ''reproducibility'' in a measure ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Vikram Adve
Vikram Adve (born 28 June 1966) is the Donald B. Gillies professor in the Department of Computer Science and a Professor in Electrical and Computer Engineering at the University of Illinois at Urbana-Champaign. Academia In 2020, Vikram Adve became a co-founder and co-director of the Center for Digital Agriculture and leads AIFARMS, a $20M National Artificial Intelligence Research Institute funded by NIFA and NSF at University of Illinois at Urbana-Champaign. Vikram Adve, along with Chris Lattner, designed and developed the LLVM compiler infrastructure project in 2001. Vikram Adve and Chris Lattner received the 2012 ACM Software System Award for the LLVM software system. Vikram Adve's research interests include compilers and programming languages, and edge computing, approximate computing, software security, system reliability, and parallel programming. His group open-sourced the HPVM compiler infrastructure for various Central processing unit and Graphics processing unit arch ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Alan Perlis
Alan Jay Perlis (April 1, 1922 – February 7, 1990) was an American computer scientist and professor at Purdue University, Carnegie Mellon University and Yale University. He is best known for his pioneering work in programming languages and was the first recipient of the Turing Award. Biography Perlis was born to a Jewish family in Pittsburgh, Pennsylvania. He graduated from Taylor Allderdice High School in 1939. In 1943, he received his bachelor's degree in chemistry from the Carnegie Institute of Technology (later renamed Carnegie Mellon University). During World War II, he served in the U.S. Army, where he became interested in mathematics. He then earned both a master's degree (1949) and a Ph.D. (1950) in mathematics at Massachusetts Institute of Technology (MIT). His doctoral dissertation was titled "On Integral Equations, Their Solution by Iteration and Analytic Continuation". In 1952, he participated in Project Whirlwind. He joined the faculty at Purdue University and i ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Source Code
In computing, source code, or simply code or source, is a plain text computer program written in a programming language. A programmer writes the human readable source code to control the behavior of a computer. Since a computer, at base, only understands machine code, source code must be Translator (computing), translated before a computer can Execution (computing), execute it. The translation process can be implemented three ways. Source code can be converted into machine code by a compiler or an assembler (computing), assembler. The resulting executable is machine code ready for the computer. Alternatively, source code can be executed without conversion via an interpreter (computing), interpreter. An interpreter loads the source code into memory. It simultaneously translates and executes each statement (computer science), statement. A method that combines compilation and interpretation is to first produce bytecode. Bytecode is an intermediate representation of source code tha ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mersenne Prime
In mathematics, a Mersenne prime is a prime number that is one less than a power of two. That is, it is a prime number of the form for some integer . They are named after Marin Mersenne, a French Minim friar, who studied them in the early 17th century. If is a composite number then so is . Therefore, an equivalent definition of the Mersenne primes is that they are the prime numbers of the form for some prime . The exponents which give Mersenne primes are 2, 3, 5, 7, 13, 17, 19, 31, ... and the resulting Mersenne primes are 3, 7, 31, 127, 8191, 131071, 524287, 2147483647, ... . Numbers of the form without the primality requirement may be called Mersenne numbers. Sometimes, however, Mersenne numbers are defined to have the additional requirement that should be prime. The smallest composite Mersenne number with prime exponent ''n'' is . Mersenne primes were studied in antiquity because of their close connection to perfect numbers: the Euclid–Eule ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
University Of Michigan
The University of Michigan (U-M, U of M, or Michigan) is a public university, public research university in Ann Arbor, Michigan, United States. Founded in 1817, it is the oldest institution of higher education in the state. The University of Michigan is one of the earliest American research universities and is a founding member of the Association of American Universities. In the fall of 2023, the university employed 8,189 faculty members and enrolled 52,065 students in its programs. The university is Carnegie Classification of Institutions of Higher Education, classified among "R1: Doctoral Universities – Very high research activity". It consists of nineteen colleges and offers 250 degree programs at the undergraduate and graduate levels. The university is Higher education accreditation in the United States, accredited by the Higher Learning Commission. In 2021, it ranked third among American universities in List of countries by research and development spending, research expe ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
IBM 7030 Stretch
The IBM 7030, also known as Stretch, was IBM's first transistorized supercomputer. It was the fastest computer in the world from 1961 until the first CDC 6600 became operational in 1964."Designed by Seymour Cray, the CDC 6600 was almost three times faster than the next fastest machine of its day, the IBM 7030 Stretch." Originally designed to meet a requirement formulated by Edward Teller at Lawrence Livermore National Laboratory, the first example was delivered to Los Alamos National Laboratory in 1961, and a second customized version, the IBM 7950 Harvest, to the National Security Agency in 1962. The Stretch at the Atomic Weapons Research Establishment at Aldermaston, England was heavily used by researchers there and at AERE Harwell, but only after the development of the S2 Fortran compiler which was the first to add dynamic arrays, and which was later ported to the Ferranti Atlas of Atlas Computer Laboratory at Chilton. The 7030 was much slower than expected and failed t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
ILLIAC II
The ILLIAC II was a revolutionary super-computer built by the University of Illinois Urbana–Champaign, University of Illinois that became operational in 1962. Description The concept, proposed in 1958, pioneered Emitter-coupled logic (ECL) circuitry, pipelining, and transistor memory with a design goal of 100x speedup compared to ILLIAC I. ILLIAC II had 8192 words of core memory, backed up by 65,536 words of storage on magnetic drums. The core memory access time was 1.8 to 2 μs. The magnetic drum access time was 8.5ms. A "fast buffer" was also provided for storage of short loops and intermediate results (similar in concept to what is now called cache (computing), cache). The "fast buffer" access time was 0.25 μs. The word size was 52 bits. Floating-point numbers used a format with seven bits of exponent (power of 4) and 45 bits of mantissa. instruction set, Instructions were either 26 bits or 13 bits long, allowing packing of up to four instructions per memory word. R ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
