Venkatesh Rao@vgrTuring machines are finite games Universal Turing Machines are infinite games. Until they run out of tape that is. Homework: discuss Carsean significance of halting problem and how it related to boundaries vs horizons.11:46 PM · Sep 1, 20187 Likes
Jody Shenn@JodyShenn·Sep 1, 2018Replying to @vgrFiguring I already did in the future so gonna go with that1