Turing machines based on unsharp quantum logic

@inproceedings{Shang2012TuringMB,
  title={Turing machines based on unsharp quantum logic},
  author={Yun Shang and Xian Lu and Ruqian Lu},
  booktitle={QPL},
  year={2012}
}
In this paper, we consider Turing machines based on unsharp quantum logic. For a lattice-ordered quantum multiple-valued (MV) algebra E, we introduce E-valued non-deterministic Turing machines (ENTMs) and E-valued deterministic Turing machines (EDTMs). We discuss different E-valued recursively enumerable languages from width-first and depth-first recognition. We find that width-first recognition is equal to or less than depth-first recognition in general. The equivalence requires an underlying… 

Weighted Turing machines over strong bimonoids

It is proved that variants of P-NTM with changing its P-valued initial function have the same power as P- NTM, and that depth-first and width-first methods for defining the weight of acceptance of languages recognized by Turning machines are adapted.

On More or Less Appropriate Notions of 'Computation'

This paper presents some arguments about which notions of “computation” may be considered “reasonably acceptable” for the authors' own historic era, and emphasizes that every science-philosophical notion has its own long-term historical semantics which cannot be fixed once and forever.

References

SHOWING 1-10 OF 15 REFERENCES

Quantum complexity theory

This paper gives the first formal evidence that quantum Turing machines violate the modern (complexity theoretic) formulation of the Church--Turing thesis, and proves that bits of precision suffice to support a step computation.

Partial Observation of Quantum Turing Machines and a Weaker Well-Formedness Condition

  • S. Perdrix
  • Computer Science
    Electron. Notes Theor. Comput. Sci.
  • 2011

Classically controlled quantum computation

This work introduces a Classically controlled Quantum Turing Machine (CQTM), which is a Turing machine with a quantum tape for acting on quantum data, and a classical transition function for formalised classical control, and proves that any classical Turing machine can be simulated by a CQTM without loss of efficiency.

A theory of computation based on unsharp quantum logic: Finite state automata and pushdown automata

Automata theory based on quantum logic: some characterizations

  • Daowen Qiu
  • Computer Science, Mathematics
    Inf. Comput.
  • 2004

Quantum theory, the Church–Turing principle and the universal quantum computer

  • D. Deutsch
  • Physics, Philosophy
    Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences
  • 1985
It is argued that underlying the Church–Turing hypothesis there is an implicit physical assertion. Here, this assertion is presented explicitly as a physical principle: ‘every finitely realizible

Automata theory based on unsharp quantum logic†

It is shown that the universal validity of some important properties depend heavily on the above distributive law, and the notions of (quantum) finite automata based on these two unsharp quantum structures are introduced.

Quantum logic and automata theory

Finite automata based on quantum logic and monadic second-order quantum logic

  • Yongming Li
  • Philosophy
    Science in China Series F: Information Sciences
  • 2010
The Kleene theorem in the frame of quantum logic is presented here and it is proved that the behaviors of finite automata based on quantum logic are precisely the quantum languages definable with sentences of monadic second-order quantum logic.

Fuzzy Turing Machines Revised

This work proposes a generalization of the original model of fuzzy Turing machines and fuzzy languages that is based on rigorous mathematical fundamentals of fuzzy logic and its acceptance criterion is modified so that the resulting model obeys the Church--Turing Thesis.