Round 10: Tossup 20

In 2007, Alex Smith won a 25,000-dollar prize for showing that a system denoted (2, 3) has a “weak” form of this property. Alan Perlis coined a term referring to systems with this property that are nonetheless not very useful as “tarpits.” In 2004, Matthew Cook demonstrated that Rule 110 has this property, (10[1])thus showing elementary cellular automata can have it. In 2019, (10[2])Alex Churchill showed that the game Magic: the Gathering has this property. (10[1])Tom Wildenhain once jokingly demonstrated that Microsoft PowerPoint does in fact have this property. Given infinite memory, most programming languages, like Python and Java, have this property. A system that can compute any computable function has, for 10 points, what property of systems that are equivalent to a head that reads and writes symbols on an infinite tape? ■END■

Back to tossups

Buzzes

Summary