In computer science, a universal Turing machine (UTM) is a Turing machine that can simulate an arbitrary Turing machine on arbitrary input. The… (More)

Semantic Scholar uses AI to extract papers important to this topic.

2011

2011

- ELIZONDO GARZA
- 2011

Game-theoretic modalities and the Internet have garnered profound interest from both security experts and system administrators… (More)

Is this relevant?

2011

2011

- Paul W. Rendell
- 2011 International Conference on High Performance…
- 2011

In this paper we present a Universal Turing Machine build in the Cellular Automaton Conway's Game of Life. This is an extension… (More)

Is this relevant?

2007

2007

- Turlough Neary, Damien Woods
- MCU
- 2007

We present small polynomial time universal Turing machines with state-symbol pairs of (5, 5), (6, 4), (9, 3) and (18, 2). These… (More)

Is this relevant?

2006

2006

- Turlough Neary, Damien Woods
- Theor. Comput. Sci.
- 2006

We present a number of time-efficient small universal Turing machines. We show that there exists deterministic polynomial time… (More)

Is this relevant?

2005

2005

We present a small time-efficient universal Turing machine with 5 states and 6 symbols. This Turing machine simulates our new… (More)

Is this relevant?

2001

2001

- Manfred Kudlek, Yurii Rogozhin
- Developments in Language Theory
- 2001

With an UTM(3,9) we present a new small universal Turing machine with 3 states and 9 symbols, improving a former result of an UTM… (More)

Is this relevant?

2001

2001

- Héctor Fabio Restrepo, Daniel Mange
- ICES
- 2001

The goal of this contribution is to describe how a universal Turing machine was embedded into a hardware system in order to… (More)

Is this relevant?

Highly Cited

1996

Highly Cited

1996

- Yurii Rogozhin
- Theor. Comput. Sci.
- 1996

Let UTM(m,n) be the class of universal Turing machine with m states and n symbols. Universal Turing machines are proved to exist… (More)

Is this relevant?

Highly Cited

1985

Highly Cited

1985

- David W Deutsch
- 1985

It is argued that underlying the Church-Turing hypothesis there is an implicit physical assertion. Here, this assertion is… (More)

Is this relevant?

1952

1952

- Edward F. Moore
- ACM '52
- 1952

In 1936 Turing <supscrpt>(1)</supscrpt> defined a class of logical machines (which he called a - machines, but which are now… (More)

Is this relevant?