Book chapter · 2009
Coding runs of Turing machines, NP-completeness and related topics
Chapman & Hall/CRC studies in informatics series, 227–252 · Published 22 September 2009 · DOI 10.1201/9781439801741.ch11
In brief
“Coding runs of Turing machines, NP-completeness and related topics” is a 2009 book chapter, published in Chapman & Hall/CRC studies in informatics series. OpenAlex counts 0 citations as of 15 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.
- Citations
- 0
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Coding runs of Turing machines, NP-completeness and related topics. (2009). Chapman & Hall/CRC studies in informatics series, 227–252. https://doi.org/10.1201/9781439801741.ch11
MLA 9
“Coding runs of Turing machines, NP-completeness and related topics.” Chapman & Hall/CRC studies in informatics series, 2009, pp. 227–252. https://doi.org/10.1201/9781439801741.ch11.
Chicago
2009. “Coding runs of Turing machines, NP-completeness and related topics.” Chapman & Hall/CRC studies in informatics series: 227–252. https://doi.org/10.1201/9781439801741.ch11.
Harvard
(2009) ‘Coding runs of Turing machines, NP-completeness and related topics’, Chapman & Hall/CRC studies in informatics series, pp. 227–252. doi:10.1201/9781439801741.ch11.
IEEE
“Coding runs of Turing machines, NP-completeness and related topics,” Chapman & Hall/CRC studies in informatics series, pp. 227–252, 2009, doi: 10.1201/9781439801741.ch11.
BibTeX
@incollection{anon2009coding,
title = {{Coding runs of Turing machines, NP-completeness and related topics}},
booktitle = {Chapman \& Hall/CRC studies in informatics series},
publisher = {Chapman and Hall London},
year = {2009},
pages = {227--252},
doi = {10.1201/9781439801741.ch11},
url = {https://doi.org/10.1201/9781439801741.ch11}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Topic and keywords
Physical Sciences › Computer Science › Computational Theory and Mathematics › Computability, Logic, AI Algorithms
- Turing machines
- NP-completeness
- computational complexity
Work with this paper
Most-cited papers in Computer Science
- ImageNet classification with deep convolutional neural networksAlex Krizhevsky, Ilya Sutskever, Geoffrey E. Hinton · Communications of the ACM · 2017 · 114,726 citations
- Long Short-Term MemorySepp Hochreiter, Jürgen Schmidhuber · Neural Computation · 1997 · 109,097 citations
- A Mathematical Theory of CommunicationClaude E. Shannon · Bell System Technical Journal · 1948 · 91,736 citations
- Deep learningYann LeCun, Yoshua Bengio, Geoffrey E. Hinton · Nature · 2015 · 90,226 citations
- Faster R-CNN: Towards Real-Time Object Detection with Region Proposal NetworksShaoqing Ren, Kaiming He, Ross Girshick and 1 more · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2016 · 74,143 citations
Questions about this paper
How do I cite this paper in APA style?
Coding runs of Turing machines, NP-completeness and related topics. (2009). Chapman & Hall/CRC studies in informatics series, 227–252. https://doi.org/10.1201/9781439801741.ch11
How many times has this paper been cited?
0 times, according to OpenAlex on 15 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
OpenAlex records no free legal copy. Check your library's access, the authors' pages or a repository, or ask the corresponding author for a copy.
What is the DOI of this paper?
10.1201/9781439801741.ch11. The permanent link is https://doi.org/10.1201/9781439801741.ch11.
Bibliographic data from OpenAlex (CC0), last checked 15 November 2026. ResearchGuru does not host this paper; the links go to the publisher or the repository that does.