Universality of Quantum Turing Machines With Deterministic Control

Journal of Logic and Computation - United Kingdom
doi 10.1093/logcom/exv008
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Oxford University Press (OUP)

Related search

Universality, Turing Incompleteness and Observers

2012English

Four Small Universal Turing Machines

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2009English

Ultrametric Automata and Turing Machines

English

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

Deterministic Automata Simulation, Universality and Minimality

Annals of Pure and Applied Logic
Logic
1997English

Small Semi-Weakly Universal Turing Machines

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2009English

Implementation of DNA Pattern Recognition in Turing Machines

GSTF INTERNATIONAL JOURNAL ON COMPUTING
2011English

“Deterministic” Quantum Plasmonics

Nano Letters
Materials ScienceCondensed Matter PhysicsMechanical EngineeringNanoscienceBioengineeringNanotechnologyChemistry
2010English

A Dream of Simplicity: Scientific Computing on Turing Machines

Computing in Science and Engineering
EngineeringComputer Science
2017English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy