Related Research Articles
Gregory John Chaitin is an Argentine-American mathematician and computer scientist. Beginning in the late 1960s, Chaitin made contributions to algorithmic information theory and metamathematics, in particular a computer-theoretic result equivalent to Gödel's incompleteness theorem. He is considered to be one of the founders of what is today known as algorithmic complexity together with Andrei Kolmogorov and Ray Solomonoff. Along with the works of e.g. Solomonoff, Kolmogorov, Martin-Löf, and Leonid Levin, algorithmic information theory became a foundational part of theoretical computer science, information theory, and mathematical logic. It is a common subject in several computer science curricula. Besides computer scientists, Chaitin's work draws attention of many philosophers and mathematicians to fundamental problems in mathematical creativity and digital philosophy.
Theoretical computer science is a subfield of computer science and mathematics that focuses on the abstract and mathematical foundations of computation, such as the theory of computation, formal language theory, the lambda calculus and type theory.
Bead sort, also called gravity sort, is a natural sorting algorithm, developed by Joshua J. Arulanandham, Cristian S. Calude and Michael J. Dinneen in 2002, and published in The Bulletin of the European Association for Theoretical Computer Science. Both digital and analog hardware implementations of bead sort can achieve a sorting time of O(n); however, the implementation of this algorithm tends to be significantly slower in software and can only be used to sort lists of positive integers. Also, it would seem that even in the best case, the algorithm requires O(n2) space.
Solomon Marcus was a Romanian mathematician, member of the Mathematical Section of the Romanian Academy and emeritus professor of the University of Bucharest's Faculty of Mathematics.
Jeffrey Scott Vitter is a U.S. computer scientist and academic administrator. Born in 1955 in New Orleans, Vitter has served in several senior higher education administration posts. He is a former chancellor of the University of Mississippi. He assumed the chancellor position on January 1, 2016. His formal investiture to the chancellorship took place on November 10, 2016, at the University of Mississippi's Oxford Campus.
Noga Alon is an Israeli mathematician and a professor of mathematics at Princeton University noted for his contributions to combinatorics and theoretical computer science, having authored hundreds of papers.
In computer science, a deterministic acyclic finite state automaton (DAFSA), also called a directed acyclic word graph is a data structure that represents a set of strings, and allows for a query operation that tests whether a given string belongs to the set in time proportional to its length. Algorithms exist to construct and maintain such automata, while keeping them minimal.
John Vivian Tucker is a British computer scientist and expert on computability theory, also known as recursion theory. Computability theory is about what can and cannot be computed by people and machines. His work has focused on generalising the classical theory to deal with all forms of discrete/digital and continuous/analogue data; and on using the generalisations as formal methods for system design; based on abstract data types and on the interface between algorithms and physical equipment.
Kurt Mehlhorn is a German theoretical computer scientist. He has been a vice president of the Max Planck Society and is director of the Max Planck Institute for Computer Science.
János Pach is a mathematician and computer scientist working in the fields of combinatorics and discrete and computational geometry.
Michael John Fischer is an American computer scientist who works in the fields of distributed computing, parallel computing, cryptography, algorithms and data structures, and computational complexity.
Cristian Sorin Calude is a Romanian-New Zealander mathematician and computer scientist.
Applied mathematics is the application of mathematical methods by different fields such as physics, engineering, medicine, biology, finance, business, computer science, and industry. Thus, applied mathematics is a combination of mathematical science and specialized knowledge. The term "applied mathematics" also describes the professional specialty in which mathematicians work on practical problems by formulating and studying mathematical models.
Karl Svozil is an Austrian physicist educated at the University of Vienna and Heidelberg University. Visiting scholar at the Lawrence Berkeley Laboratory of the University of California at Berkeley, US (1982–1983), the Lebedev Institute of the Moscow State University, and the Ioffe Institute, St. Petersburg (1986). Docent in Theoretical Physics at the Vienna Technical University. Ao. Univ. Professor at the Institute for Theoretical Physics of the Vienna Technical University. External Researcher at the Centre for Discrete Mathematics and Theoretical Computer Science of the University of Auckland.
Grzegorz Rozenberg is a Polish and Dutch computer scientist.
Rodney Graham Downey is a New Zealand and Australian mathematician and computer scientist, an emeritus professor in the School of Mathematics and Statistics at Victoria University of Wellington in New Zealand. He is known for his work in mathematical logic and computational complexity theory, and in particular for founding the field of parameterised complexity together with Michael Fellows.
Ludwig Staiger is a German mathematician and computer scientist at the Martin Luther University of Halle-Wittenberg.
Universality probability is an abstruse probability measure in computational complexity theory that concerns universal Turing machines.
Bakhadyr M. Khoussainov is a computer scientist and mathematician, who was born and educated in the Soviet Union, works in the fields of mathematical logic, computability theory, computable model theory and theoretical computer science. With Anil Nerode, he is the co-founder of the theory of automatic structures, which is an extension of the theory of automatic groups.
Giuseppe Longo is an Italian mathematician, epistemologist, theoretical biologist, author, and academic. He is the Research Director Emeritus at Centre national de la recherche scientifique at the Cavaillès interdisciplinary center of École Normale Supérieure (ENS) in Paris.
References
- 1 2 3 Michael J. Dinneen profile, University of Auckland, retrieved 2024-06-12
- ↑ "Our personnel". Center for Discrete Mathematics and Theoretical Computer Science. Retrieved 2024-06-12.
