This paper is concerned with the solvability of the problem of processor renaming in unreliable, completely asynchronous distributed systems, contradicting the widely held belief that no nontrivial problem can be solved in such a system.Expand

We show that even if we allow nonuniform algorithms, an arbitrary number of processors, and arbitrary instruction sets, $\Omega (\log n)$ is a lower bound on the time required to compute various simple functions, including sorting n keys and finding the logical “or” of n bits.Expand

We show that large classes of Boolean concepts that only depend on a small fraction of their variables—so-called juntas—can be learned efficiently from uniformly distributed examples corrupted by random attribute and classification noise.Expand