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.
Review
2018
Review
2018
Abstract Microscopic methods and tools to describe nuclear dynamics have considerably been improved in the past few years. They… Expand
  • table 1
  • figure 1
  • figure 4
  • figure 5
  • figure 6
Review
2017
Review
2017
Abstract Quantum simulations consist in the intentional reproduction of physical or unphysical models into another more… Expand
Highly Cited
2002
Highly Cited
2002
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
Highly Cited
1999
Highly Cited
1999
  • P. Shor
  • SIAM Rev.
  • 1999
  • Corpus ID: 2337707
A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate… Expand
  • table 3.1
  • table 3.2
  • figure 5.1
Highly Cited
1998
Highly Cited
1998
Similarity is an important and widely used concept. Previous definitions of similarity are tied to a particular application or a… Expand
  • figure 1
  • table 1
  • table 2
  • table 3
  • table 4
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
  • table 1.1
  • figure 1.1
  • table 1.1
  • figure 1.3
  • figure 3.1
Highly Cited
1992
Highly Cited
1992
From the Publisher: Genetic algorithms are playing an increasingly important role in studies of complex adaptive systems… Expand
Highly Cited
1983
Highly Cited
1983
Cellular automata are used as simple mathematical models to investigate self-organization in statistical mechanics. A detailed… Expand
  • figure 4
  • figure 5
  • figure 6
  • figure 7
  • figure 9
Highly Cited
1982
Highly Cited
1982
Conservative logic is a comprehensive model of computation which explicitly reflects a number of fundamental principles of… Expand
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 6
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