Since the 1930s, the theory of computation has profoundly influenced philosophical thinking about topics such as the theory of the mind, the nature of mathematical knowledge and the prospect of ...

The axiomatic treatment of the computational complexity of partial recursive functions initiated by Blum is extended to relatively computable functions (as computed, for example, by Turing machines ...

Graph theory has long provided a robust mathematical framework for investigating networks, relations and connectivity in both abstract and applied settings. Recent advances have markedly refined our ...

Computational complexity and computability are central themes in theoretical computer science that address the fundamental question of what can be computed and at what cost. Computability theory ...

Our research area encompasses the study of computation, computational models, computational complexity, algorithm design, algorithm verification, combinatorial optimization, computational biology and ...

NEW YORK, August 16, 2018 - The 2018 Donald E. Knuth Prize will be awarded to Johan Torkel Håstad of the KTH Royal Institute of Technology (Sweden) for his long and sustained record of milestone ...

How do quantum and classical computational resources compare? CWI PhD student Jordi Weggemans hopes to answer this question ...

This is a preview. Log in through your library . Abstract In the game theory approach to the problem of allocating cost, the users of a facility are viewed as players in a cooperative n-person game.

Northwestern is a world leader in the design of soft materials, and the Center for Computation and Theory of Soft Materials (CCTSM) is at the forefront of this effort. Providing computational ...