Question

A limit on these objects was proven in 2024 by an anonymous contributor to b·b·challenge, which seeks to solve a class (20[1])of problems about these (20[1])objects that Tibor Radó introduced. Rice’s (20[1])theorem can be stated (20[1])in terms of the inability of these objects to "recognize" non-trivial (20[1])properties. (20[1])The utility (20[1])of these objects is described in the typical formulation of a conjecture co-named for (*) Alonzo Church. (10[8]0[2])Busy (10[1])beavers (10[2])are (10[1])a case (10[1]0[1])of these objects, (10[1])which are often (0[1])contrasted (10[1])with a less general class of "finite-state" objects that cannot (10[2])write. These objects consist (10[2])of cells read from an infinitely-long shifting tape. (10[2])For 10 points, (10[1])name these computational (0[1])models named for a pioneering (10[2])English computer scientist. ■END■ (10[5])

Back to tossups

Buzzes

Summary