A social welfare function for a denumerable society satisfies Pairwise Computability if for each pair (x, y) of alternatives, there exists an algorithm that can decide from any description of each ...

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

Initially discussed are some of Alan Turing's wonderfully profound and influential ideas about mind and mechanism—including regarding their connection to the main topic of the present study, which is ...

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.