Mark delves into Putnam's mapping of inputless finite state automata onto digital counters, challenging the complexity of real computations. Chalmers counters with the concept of combinatorial state automata, highlighting the limitations of Putnam's mapping when dealing with machines requiring input.
