A Comparison of the Work Done by Generalized Sequential Machines and Turing Machines

Transactions of the American Mathematical Society - United States
doi 10.1090/s0002-9947-1962-0138546-7
Full Text
Abstract

Available in full text

Date
Authors
Publisher

American Mathematical Society (AMS)

Related search

Ultrametric Automata and Turing Machines

English

Four Small Universal Turing Machines

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2009English

Small Semi-Weakly Universal Turing Machines

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2009English

A Dream of Simplicity: Scientific Computing on Turing Machines

Computing in Science and Engineering
EngineeringComputer Science
2017English

Logical Depth for Reversible Turing Machines With an Application to the Rate of Decrease in Logical Depth for General Turing Machines

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2019English

Universality of Quantum Turing Machines With Deterministic Control

Journal of Logic and Computation
ArtsHumanitiesHardwareArchitectureLogicTheoretical Computer ScienceSoftware
2015English

Implementation of DNA Pattern Recognition in Turing Machines

GSTF INTERNATIONAL JOURNAL ON COMPUTING
2011English

Fractal Geometry, Turing Machines and Divide-And-Conquer Recurrences

RAIRO - Theoretical Informatics and Applications
MathematicsComputer Science ApplicationsSoftware
1994English

On the Power of Real Turing Machines Over Binary Inputs

SIAM Journal on Computing
MathematicsComputer Science
1997English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy