Turing Completeness is a property of a computational system that enables it to simulate a Turing machine, thereby being capable of performing any computation that is algorithmically expressible.
162
Publications
6.1K
Citations
277
Authors
161
Institutions
Publications per year
2017–2026
26
Variants
Turing-complete
Parents
Publications
162
Control-flow bending: on the effectiveness of control-flow integrity
Nicolas Carlini, Antonio Barresi, Mathias Payer et al. · 2015 · 293 citations
The universal computer: the road from Leibniz to Turing
Choice Reviews Online · 2001 · 226 citations
Small universal Turing machines
Yurii Rogozhin · Theoretical Computer Science · 1996 · 217 citations · Full text
1–5 of 162
Authors
277
- BJ
4
h-index
- DP
4
h-index
- VK
3
h-index
- RR
3
h-index
- FS
3
h-index
1–5 of 277
Institutions
161
University of Chicago
Chicago, United States
7 h-index
7 publications
205 citations
National University of Singapore
Singapore, Singapore
6 h-index
7 publications
261 citations
University of California, Berkeley
Berkeley, United States
6 h-index
8 publications
509 citations
Centre National de la Recherche Scientifique
Paris, France
5 h-index
6 publications
124 citations
University of Canterbury
Christchurch, New Zealand
5 h-index
7 publications
267 citations
University of Wisconsin–Madison
Madison, United States
4 h-index
4 publications
160 citations
University of Auckland
Auckland, New Zealand
4 h-index
5 publications
221 citations
University of Toronto
Toronto, Canada
3 h-index
3 publications
132 citations
1–8 of 161
Venues
- Journal of Symbolic Logic
11 publications · 466 citations
11
h-index
- Minds and Machines
7 publications · 263 citations
7
h-index
- Theoretical Computer Science
4 publications · 288 citations
4
h-index
- Choice Reviews Online
CRO · 3 publications · 250 citations
3
h-index
- Proceedings of the American Mathematical Society
PROC · 3 publications · 66 citations
3
h-index
1–5