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

A coarse description of a set A ⊆ ω is a set D ⊆ ω such that the symmetric difference of A and D has asymptotic density 0. We study the extent to which noncomputable information can be effectively ...

Algorithmic randomness was originally defined for Cantor space with the fair-coin measure. Recent work has examined algorithmic randomness in new contexts, in particular closed subsets of 2ω([2] and ...

Computer scientists are looking to evolutionary biology for inspiration in the search for optimal solutions among astronomically huge sets of possibilities. Creationists love to insist that evolution ...

There is a growing sense among physicists that all physical processes can be thought of in terms of the information they store and process; by some accounts information is the basic unit of existence ...

Unsupervised, model-free method preserves key data better than traditional statistical techniques for next generation cognitive ML for multi-modal data. These methods prove the utility of algorithmic ...

video: This is an attempt to explain what we think are some of the most salient results of our research packed in a 4-minute video. Among other striking results, we have recently shown that humans ...