HomeResearch-feedChannelRankingsGCTTHU AI TROpen DataMust Reading

Turing machine-inspired computer science results

Juris Hartmanis
Juris Hartmanis

CiE, pp. 276-282, 2012.

Cited by: 0|Bibtex|Views7|DOI:https://doi.org/10.1007/978-3-642-30870-3_28
EI
Other Links: dblp.uni-trier.de|dl.acm.org|academic.microsoft.com
Keywords:
machine-inspired computer science resulttheoretical computer sciencememory-bounded computationcomputational complexity theorytape squareMore(6+)

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 discip...More

Code:

Data:

Your rating :
0

 

Tags
Comments