Showing papers by "Juris Hartmanis published in 2012"
18 Jun 2012
TL;DR: The Turing machine model was ideal for the creation of computational complexity theory, which has grown into an essential part of theoretical computer science and has found application in other disciplines.
Abstract: This paper discusses how the Turing machine model directly inspired and guided developments in theoretical computer science. In particular, the Turing machine model was ideal for the creation of computational complexity theory, which has grown into an essential part of theoretical computer science and has found application in other disciplines. The machine operation count was used to define time-bounded computations and the tape squares used defined the tape or memory-bounded computations. The definition and exploration of the corresponding asymptotic complexity classes followed naturally.
1 citations