Algorithmic randomness and computability theory inhabit a crossroads between mathematics and computer science, providing a rigorous framework for understanding randomness in infinite sequences and ...

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 ...

Quantum theory describes events that take place on extremely short time scales. In the past, such events were regarded as 'momentary' or 'instantaneous': An electron orbits the nucleus of an atom—in ...

This course gives an introduction to the mathematical foundations of computation. The course will look at Turing machines, universal computation, the Church-Turing thesis, the halting problem and ...

We show that to every recursive total continuous functional Φ there is a PCF-definable representative Ψ of Φ in the hierarchy of partial continuous functionals, where PCF is Plotkin's programming ...

This year a series of events around the world will celebrate the work of Alan Turing, the father of the modern computer, as the 100th anniversary of his birthday approaches on June 23. In a book ...

CHARLESTON -- A two-part lecture series titled “Reflections on the Theory of Computability” will be offered Sept. 29-30 at Eastern Illinois University. Both talks will take place from 4 to 4:50 p.m.

What is the best way for a group of individuals to cooperate? This is a longstanding question with roots in game theory, a branch of science which uses mathematical models of how individuals should ...

This course gives an introduction to the mathematical foundations of computation. The course will look at Turing machines, universal computation, the Church-Turing thesis, the halting problem and ...