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

Turing machine equivalents

A Turing machine is a hypothetical device with an infinite memory capacity, first conceived by Alan Turing in 1936. The machine manipulates symbols… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
  • Atatürk Bahçe Kültürleri Merkez Araştırma Enstitüsü, Gıda Teknolojileri Bölümü, Yalova, Sebzecilik Bölümü
  • 2017
  • Corpus ID: 189801998
The antioxidant activity and properties of 12 wild mushrooms (Lactarius piperatus, Tricholoma anatolicum, Amanita caesarea… Expand
Is this relevant?
2017
2017
  • Mak
  • 2017
  • Corpus ID: 143430894
It is shown that parallel machines are always faster than sequential machines for a wide range of machine models, including the… Expand
Is this relevant?
2015
2015
Aims: To determine the in vitro anti-elastase, anti-collagenase and antioxidant properties of two Asian herbs: Pueraria candollei… Expand
  • figure 1
  • figure 2
  • table 2
Is this relevant?
2015
2015
Moderate wine consumption may reduce the incidence of certain age-related chronic diseases such as heart disease, hypertension… Expand
  • figure 2.1
  • figure 2.2
  • figure 2.3
  • figure 2.4
  • table 2.1
Is this relevant?
2014
2014
Methanolic extracts of 39 different population of three species of Salvia (Salvia fruticosa Mill. 20 sample, Salvia pomifera Mill… Expand
  • table 1
Is this relevant?
2014
2014
We hypothesized that cooking methods generally applied to Gom-chi preparation such as blanching, pan frying, and microwaving… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • table 2
Is this relevant?
2014
2014
Cyanobacteria blooms are common in Baltic Sea and their intensity have been increased due to anthropogenic eutrophication. In… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1982
1982
Abstract Every multidimensional Turing machine can be simulated on-line by a tree machine in nearly the same amount of time. 
Is this relevant?
1981
1981
  • M. Loui
  • Theor. Comput. Sci.
  • 1981
  • Corpus ID: 34423014
Let L be a language recognized by a nondeterministic d-dimensional Turing machine with one worktape head of time complexity T(n… Expand
Is this relevant?
1980
1980
Every multidimensional Turing-machine can be simulated on-line by a tree-tape Turing-machine in nearly the same amount of time. 
Is this relevant?