Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Universal Turing machine

Known as: Universal computing, U-machine, Universal turing machines 
In computer science, a universal Turing machine (UTM) is a Turing machine that can simulate an arbitrary Turing machine on arbitrary input. The… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2005
Highly Cited
2005
  • Dr. Marcus Hutter
  • Texts in Theoretical Computer Science An EATCS…
  • 2005
  • Corpus ID: 33352850
Foundational theories have contributed greatly to scientific progress in many fields. Examples include Zermelo-Fraenkel set… Expand
Is this relevant?
Highly Cited
2002
Highly Cited
2002
  • Paul Rendell
  • Collision-Based Computing
  • 2002
  • Corpus ID: 122804909
This chapter describes a Turing machine built from patterns in the Conway’s Game of Life cellular automaton. It outlines the… Expand
  • figure 1.1
  • figure 1.2
  • figure 1.3
  • figure 1.4
  • figure 1.5
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Beyond the striking differences in the value priorities of groups is a surprisingly widespread consensus regarding the… Expand
  • table 2
  • table 3
  • table 5
  • table 6
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Interest in chemical computation has followed four different paths. It is one of the natural extensions of discussions about… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
Is this relevant?
Highly Cited
1996
Highly Cited
1996
  • Ivan Korec
  • Theor. Comput. Sci.
  • 1996
  • Corpus ID: 33725652
Abstract Several small universal register machines are constructed. The number of instructions vary from 32 to 14, depending on… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Abstract Let UTM( m , n ) be the class of universal Turing machine with m states and n symbols. Universal Turing machines are… Expand
Is this relevant?
Highly Cited
1991
Highly Cited
1991
Abstract Applications of conformal field theory to the theory of fractional quantum Hall systems are discussed. In particular… Expand
Is this relevant?
Highly Cited
1985
Highly Cited
1985
The author presents a new class of universal routing networks, called fat-trees, which might be used to interconnect the… Expand
  • figure 1
  • figure 3
  • figure 2
  • figure 4
Is this relevant?
Highly Cited
1966
Highly Cited
1966
Anyone who has sought to understand the shifts in international trade and international investment over the past twenty years has… Expand
  • figure I
Is this relevant?
Highly Cited
1937
Highly Cited
1937
1. Computing machines. 2. Definitions. Automatic machines. Computing machines. Circle and circle-free numbers. Computable… Expand
  • figure 2
  • figure 1
  • figure 3
  • figure 4
Is this relevant?