Related Research Articles
John Horton Conway was an English mathematician. He was active in the theory of finite groups, knot theory, number theory, combinatorial game theory and coding theory. He also made contributions to many branches of recreational mathematics, most notably the invention of the cellular automaton called the Game of Life.
In the area of abstract algebra known as group theory, the monster group M (also known as the Fischer–Griess monster, or the friendly giant) is the largest sporadic simple group, having order
Stephen Richard "Steve" Bourne is an English computer scientist based in the United States for most of his career. He is well known as the author of the Bourne shell (sh), which is the foundation for the standard command-line interfaces to Unix.
Geometry of numbers is the part of number theory which uses geometry for the study of algebraic numbers. Typically, a ring of algebraic integers is viewed as a lattice in and the study of these lattices provides fundamental information on algebraic numbers. Hermann Minkowski initiated this line of research at the age of 26 in his work The Geometry of Numbers.
Combinatorial game theory is a branch of mathematics and theoretical computer science that typically studies sequential games with perfect information. Study has been largely confined to two-player games that have a position that the players take turns changing in defined ways or moves to achieve a defined winning condition. Combinatorial game theory has not traditionally studied games of chance or those that use imperfect or incomplete information, favoring games that offer perfect information in which the state of the game and the set of available moves is always known by both players. However, as mathematical techniques advance, the types of game that can be mathematically analyzed expands, thus the boundaries of the field are ever changing. Scholars will generally define what they mean by a "game" at the beginning of a paper, and these definitions often vary as they are specific to the game being analyzed and are not meant to represent the entire scope of the field.
In the mathematical classification of finite simple groups, there are a number of groups which do not fit into any infinite family. These are called the sporadic simple groups, or the sporadic finite groups, or just the sporadic groups.
The Department of Computer Science and Technology, formerly the Computer Laboratory, is the computer science department of the University of Cambridge. As of 2023 it employed 56 faculty members, 45 support staff, 105 research staff, and about 205 research students. The current Head of Department is Professor Alastair Beresford.
Elwyn Ralph Berlekamp was a professor of mathematics and computer science at the University of California, Berkeley. Berlekamp was widely known for his work in computer science, coding theory and combinatorial game theory.
Richard Kenneth Guy was a British mathematician. He was a professor in the Department of Mathematics at the University of Calgary. He is known for his work in number theory, geometry, recreational mathematics, combinatorics, and graph theory. He is best known for co-authorship of Winning Ways for your Mathematical Plays and authorship of Unsolved Problems in Number Theory. He published more than 300 scholarly articles. Guy proposed the partially tongue-in-cheek "strong law of small numbers", which says there are not enough small integers available for the many tasks assigned to them – thus explaining many coincidences and patterns found among numerous cultures. For this paper he received the MAA Lester R. Ford Award.
CPL is a multi-paradigm programming language developed in the early 1960s. It is an early ancestor of the C language via the BCPL and B languages.
The Cambridge CAP computer was the first successful experimental computer that demonstrated the use of security capabilities, both in hardware and software. It was developed at the University of Cambridge Computer Laboratory in the 1970s. Unlike most research machines of the time, it was also a useful service machine.
ALGOL 68C is an imperative computer programming language, a dialect of ALGOL 68, that was developed by Stephen R. Bourne and Michael Guy to program the Cambridge Algebra System (CAMAL). The initial compiler was written in the Princeton Syntax Compiler that was implemented by J. H. Mathewman at Cambridge.
Robert Arnott Wilson is a retired mathematician in London, England, who is best known for his work on classifying the maximal subgroups of finite simple groups and for the work in the Monster group. He is also an accomplished violin, viola and piano player, having played as the principal viola in the Sinfonia of Birmingham. Due to a damaged finger, he now principally plays the kora.
In the area of modern algebra known as group theory, the Conway group is a sporadic simple group of order
Cambridge Algebra System (CAMAL) is a computer algebra system written in Cambridge University by David Barton, Steve Bourne, and John Fitch. It was initially used for computations in celestial mechanics and general relativity. The foundation code was written in Titan computer assembler. In 1973, when Titan was replaced with an IBM370/85, it was rewritten in ALGOL 68C and then BCPL where it could run on IBM mainframes and assorted microcomputers.
Patrick Michael Grundy was an English mathematician and statistician. He was one of the eponymous co-discoverers of the Sprague–Grundy function and its application to the analysis of a wide class of combinatorial games.
Thomas K. Porter is the senior vice president of production strategy at Pixar and one of the studio's founding employees.
References
- ↑ "Archived copy". Archived from the original on 21 February 2007. Retrieved 22 March 2008.
{{cite web}}: CS1 maint: archived copy as title (link) - ↑ Weisstein, Eric W. "Soma Cube". Wolfram MathWorld.
- ↑ Kustes, William (Bill). "The SOMAP construction map". SOMA News.
- ↑ Guy, Richard K. (November 1982). "John Horton Conway: Mathematical Magus". The Two-Year College Mathematics Journal. 13 (5): 290–299. doi:10.2307/3026500. JSTOR 3026500.
- ↑ Conway, J.H.; Guy, M. J. T. (1982). "Message graphs". Annals of Discrete Mathematics. 13: 61–64.
- ↑ Griess, Robert L. Jr. (1998). Twelve Sporadic Groups. New York City: Springer. p. 127. ISBN 978-3-662-03516-0.
- ↑ Cassels, J. W. S. (1995). "Computer-aided serendipity". Rendiconti del Seminario Matematico della Università di Padova. 93: 187–197.
- ↑ Cassels, J. W. S.; Guy, M. J. T. (1966). "On the Hasse principle for cubic surfaces". Mathematika . 13 (2): 111–120. doi:10.1112/S0025579300003879.
- ↑ Herbert, Andrew J.; Needham, Roger Michael; Spärck Jones, Karen I. B. (2004). Computer Systems: Theory, Technology, and Applications: a Tribute to Roger Needham . p. 105.
- ↑ "Atlas 2 at Cambridge Mathematical Laboratory (And Aldermaston and CAD Centre)" (PDF). Archived from the original (PDF) on 25 November 2018. Retrieved 24 July 2020.
- ↑ Hartley, David, ed. (21 July 1999). "EDSAC 1 and after". Computer Laboratory. University of Cambridge.
- ↑ Wheeler, David; Hartley, David (March 1999). "Computer Laboratory - Events in the early history of the Computer Laboratory". Department of Computer Science and Technology. University of Cambridge.
- ↑ The Encyclopedia of Computer Languages Archived 25 August 2007 at the Wayback Machine
- ↑ ALGOL 68C
| Authority control databases: Academics |
|---|
