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 (10[1])demonstrated that Rule 110 (10[1])has this property, (10[1])thus showing (10[1])elementary cellular (10[1])automata (-5[1])can have it. (10[1]-5[1])In 2019, (10[3])Alex Churchill showed that the game Magic: the Gathering (10[5])has this (10[1])property. (10[12]-5[1])Tom Wildenhain once jokingly (-5[1])demonstrated that (10[1])Microsoft PowerPoint does in fact (10[1])have (10[1])this property. (10[1]-5[1])Given infinite memory, most (-5[1])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 (-5[1])symbols on an infinite tape? (10[3]0[4])■END■