Putnam's Rocks Are Clocks

Ramón Casares
2017 Figshare  
Putnam proved that "every ordinary open system is a realization of every abstract finite automaton", showing that computing is meaningless. Analyzing a simpler version of his proof, we conclude that giving a meaning to a computation requires computing, which is meaningless, starting a recursion.
doi:10.6084/m9.figshare.5450278.v1 fatcat:2ec75k5xxfdxjjamw5buimemja