Theory of Computation

Quantum algorithms can be roughly categorized by the type of speedup achieved over corresponding classical algorithms.

Binary combinatory logic (BCL) is a computer programming language that uses binary terms 0 and 1 to create a complete formulation of combinatory logic using only the symbols 0 and 1.

founding mother of recursion theory

programming languages and the theory of computation

best known for his work in combinatory logic

a great influence on automata and cybernetics

He was a pioneer in building the mathematical framework of quantum physics, in the development of functional analysis, and in game theory, introducing or codifying concepts including cellular automata, the universal constructor and the digital computer.

Pandya leads the Theoretical Computer Science Group there.

Pawlak was known for his contribution to many branches of theoretical computer science.

Rajeev Motwani (Hindi: राजीव मोटवानी , 24 March 1962-5 June 2009) was an Indian-American professor of computer science at Stanford University whose research focused on theoretical computer science.

In addition to his contributions to theoretical computer science, Coquand is also known as the co-creator of the Rocq (formerly named Coq, the name is a reference partly to Coquand's surname) proof assistant, which he began developing in 1984 while working at INRIA (a French national research institute for computer science and mathematics), and which was released officially in 1989.

emberg (Institut für Mathematische Maschinen und Datenverarbeitung) known for his work on automata theory, parallel computing, artificial intelligence, man-machine interfaces and computer graphics.

Kurt Mehlhorn (born 29 August 1949) is a German theoretical computer scientist.

In complexity theory it was the first problem proved to be NP-complete

Vickers' main interest lies within geometric logic.

is a method of transforming a regular expression into an equivalent nondeterministic finite automaton (NFA)

He invented the Hartley oscillator and the Hartley transform, and contributed to the foundations of information theory.

He created or co-created the universal grammar theory, the generative grammar theory, the Chomsky hierarchy, and the minimalist program.

Her dissertation was on the hypercomputation.

one of several mathematical modeling languages for the description of distributed systems

In the computer science subfield of algorithmic information theory, a Chaitin constant, Chaitin omega number, or halting probability is a real number that, informally speaking, represents the probability that a randomly constructed program will halt.

contribution to the nascent theory of linear programming (LP)

Quine was a teacher of logic and set theory.

is a French mathematician and theoretical computer scientist known for his contributions to coding theory and to combinatorics on words

Property testing is a field of theoretical computer science, concerned with the design of super-fast algorithms for approximate decision making

Chaff is an algorithm for solving instances of the Boolean satisfiability problem in programming.

One of the students of Alonzo Church, Kleene, along with Rózsa Péter, Alan Turing, Emil Post, and others, is best known as a founder of the branch of mathematical logic known as recursion theory, which subsequently helped to provide the foundations of theoretical computer science.

his contribution to computability theory, especially solving Hilbert's tenth problem, through Matiyasevich's theorem

Programming languages Program analysis Formal verification Theoretical computer science

Theoretical computer science Quantum information and Quantum foundations, foundations Game semantics Category Theory

Kalmár is considered the founder of mathematical logic and theoretical computer science in Hungary.

Judith Anne Goldsmith is a computer scientist whose publications span a wide range of topics including artificial intelligence, computational complexity theory, decision theory, and computer science education.

Mathematics Theoretical computer science

Her research focuses on computational complexity theory, DNA computing, and bioinformatics.

His research is in computational complexity theory, cryptography and security protocols.

He is one of the key developers of descriptive complexity

His results on the closure of non-deterministic space under complement

She has been Professor of Theoretical Computer Science at the Department of Computing, Imperial College London since 2009.

The driver scheduling problem (DSP) is type of problem in operations research and theoretical computer science.

Ingo Wegener (December 4, 1950 in Bremen, November 26, 2008 in Bielefeld) was an influential German computer scientist working in the field of theoretical computer science.

His research was concentrated in three areas: threshold logic, probabilistic automata, and asynchronous circuits.

His research career, which spanned over 40 years, was focused on formal languages and automata theory.

Dimitris Fotakis (Greek: Δημήτριος (Δημήτρης) Φωτάκης) is associate professor of Theoretical Computer Science at the National Technical University of Athens.

He is known for his work in randomness in computing, algorithmic complexity and intractability, average-case complexity, foundations of mathematics and computer science, algorithmic probability, theory of computation, and information theory.

His research is in theoretical computer science, especially computational complexity theory.

Boris (Boaz) Abramovich Trakhtenbrot (Russian: Борис Авраамович Трахтенброт, Hebrew: בועז טרכטנברוט; 19 February 1921-19 September 2016) was a Russian-Israeli mathematician in logic, algorithms, theory of computation, and cybernetics.

He was celebrated for founding ultrametric algorithms and for fundamental contributions to the theory of computation, probabilistic algorithms, inductive inference, and quantum computing.

His work includes formal languages, digital circuits and computational complexity theory.