While formal algorithms have existed for millennia (Euclid's algorithm for determining the greatest common divisor of two numbers is still used in computation), it was not until 1936 that Alan Turing, Alonzo Church and Stephen Kleene formalized the definition of an algorithm in terms of computation.
Bachelor of Science | National Science Foundation | American Association for the Advancement of Science | political science | Master of Science | Science | Apple Computer | Computer Science | computer | computer science | science | 3D computer graphics | Political Science | personal computer | Mainframe computer | Mystery Science Theater 3000 | Norwegian University of Science and Technology | Computer network | Computer-generated imagery | Computer programming | Sony Computer Entertainment | science fiction film | Weizmann Institute of Science | Science fiction | Indian Institute of Science | The Christian Science Monitor | Science (journal) | Intel International Science and Engineering Fair | Computer hardware | Science Applications International Corporation |
Carsten Lund (born July 1, 1963) is a Danish-born theoretical computer scientist, currently working at AT&T Labs in Florham Park, New Jersey, United States.
While epistemology has a long philosophical tradition dating back to Ancient Greece, epistemic logic is a much more recent development with applications in many fields, including philosophy, theoretical computer science, artificial intelligence, economics and linguistics.
Neil Immerman (24 November 1953, Manhasset, New York) is an American theoretical computer scientist, a professor of computer science at the University of Massachusetts Amherst.
On September 17, 2008, a team of researchers at the University of Texas at Dallas led by Founders Professor Hal Sudborough announced the acceptance by the journal Theoretical Computer Science of a more efficient algorithm for pancake sorting than the one proposed by Gates and Papadimitriou.
In ring theory, combinatorics, functional analysis, and theoretical computer science, a semifield is a semiring (MSC 16Y60) (S,+,·) in which all elements have a multiplicative inverse.
The scope of BCTCS includes all aspects of theoretical computer science, including algorithms, complexity, semantics, formal methods, concurrency, types, languages and logics.
The Center for Discrete Mathematics and Theoretical Computer Science (DIMACS) is a collaboration between Rutgers University, Princeton University, and the research firms AT&T, Bell Labs, Applied Communication Sciences, and NEC.
Hava Siegelmann and Eduardo Sontag, “Analog Computation via Neural Networks,” Theoretical Computer Science 131, 1994: 331-360.
Research topics span from theoretical computer science, such as Formal languages, Formal methods, or more mathematically-oriented topics such as Information theory, optimization, Complex system... to application-driven topics like Bioinformatics, image and video compression, Handwriting recognition, Computer graphics, Medical imaging, Content-based image retrieval...