Abstract: Previous results state that there is no single universal search algorithm which outperforms other algorithms in terms of search on functions over finite domains. We consider functions with ...

Abstract: A subset of a set of terminals that observe correlated signals seek to compute a function of the signals using public communication. It is required that the value of the function be ...

We introduce Dendry, a procedural function that generates dendritic patterns and is locally computable. The function is controlled by parameters such as the level of branching, the degree of local ...

This work presents a concrete, mathematically precise model of what humans can compute in their heads. It thereby provides a method to probe the limits of human computation (can humans generate ...

The study of computable algebraic structures lies at the intersection of algebra, computer science and complexity theory. At its core, this field investigates how abstract algebraic systems can be ...