The Zombie Misconception of Theoretical Computer Science

In Michael Sipser’s Introduction to the Theory of Computation textbook, he has one Platonically perfect homework exercise, so perfect that I can reconstruct it from memory despite not having opened the book for over a decade. It goes like this: The correct answer is that yes, f is computable. Why? Because the constant 1 function […]