order perform rigorous study computation computer scientists work mathematical abstraction computers called model computation several models use commonly examined turing machine ref name hodges ref computer scientists study turing machine simple formulate analyzed used prove results represents many consider powerful possible reasonable model computation see church turing thesis might seem potentially infinite memory capacity unrealizable attribute decidable problem ref name monk ref solved turing machine
Formal science Computer science Theory of computation