Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
  • 2011
  • Corpus ID: 15744334
The analysis of replication is an important problem. In this work, we prove the study of red-black trees. In this work, we… 
2011
2011
  • 2011
  • Corpus ID: 5640696
In recent years, much research has been devoted to the simulation of forward-error correction; however, few have investigated the… 
2008
2008
Numerous results for simple computationally universal systems are presented, with a particular focus on small universal Turing… 
2008
2008
  • Yongming Li
  • 2008
  • Corpus ID: 21462507
Fuzzy Turing machines are the formal models of fuzzy algorithms or fuzzy computations. In this paper we give several different… 
Highly Cited
2006
Highly Cited
2006
Randomly connecting networks have proven to be universal computing machines. By interconnecting a set of nodes in a random way… 
Highly Cited
2003
Highly Cited
2003
Optical heterodyne-detected optical Kerr effect (OHD-OKE) experiments are used to study the orientational dynamics of the ionic… 
Highly Cited
1983
Highly Cited
1983
A random mixture of bifunctional and tetrafunctional units is placed on a simple cubic lattice. Permanent bonds between these… 
Highly Cited
1961
Highly Cited
1961
The 2π and 3π resonances are re-examined from the point of view that they are vector mesons coupled to conserved currents. The… 
1957
1957
In [l], the author has proposed a definition of the notion, "universal Turing machine." The definition in [l] is open to the… 
1952
1952
In 1936 Turing (1) defined a class of logical machines (which he called a - machines, but which are now generally called Turing…