Universal Turing Machines is a theoretical computational model that belongs to the class of Turing machines and is distinguished by its ability to simulate any other Turing machine given an appropriate input encoding.
175
Publications
18K
Citations
241
Authors
160
Institutions
Publications per year
2017–2026
26
Variants
Utm
Publications
175
Ethan Bernstein, Umesh Vazirani · SIAM Journal on Computing · 1997 · 1.5K citations
Ethan Bernstein, Umesh Vazirani · 1993 · 1.3K citations
1–5 of 175
Authors
241
- TN
6
h-index
- DW
5
h-index
- BJ
4
h-index
- MM
4
h-index
- HZ
4
h-index
1–5 of 241
Institutions
160
University College Cork
Cork, Ireland
5 h-index
8 publications
383 citations
University of Canterbury
Christchurch, New Zealand
4 h-index
5 publications
422 citations
University of California, Berkeley
Berkeley, United States
4 h-index
7 publications
351 citations
Huazhong University of Science and Technology
Wuhan, China
3 h-index
5 publications
252 citations
Google (United States)
Mountain View, United States
3 h-index
3 publications
95 citations
University of Auckland
Auckland, New Zealand
3 h-index
5 publications
82 citations
Universidad de Sevilla
Seville, Spain
3 h-index
6 publications
160 citations
Michigan State University
East Lansing, United States
3 h-index
3 publications
43 citations
1–8 of 160
Venues
- Theoretical Computer Science
9 publications · 615 citations
9
h-index
- Fundamenta Informaticae
6 publications · 139 citations
6
h-index
- Physical Review Letters
PRL · 5 publications · 993 citations
5
h-index
- Choice Reviews Online
CRO · 5 publications · 519 citations
5
h-index
- Mathematical Structures in Computer Science
MSCS · 4 publications · 97 citations
4
h-index
1–5