The computing power of Turing machine based on quantum logic
From MaRDI portal
Cites work
- 1-way quantum finite automata: strengths, weaknesses and generalizations
- A theory of computation based on quantum logic. I
- Algebraic Analysis of Many Valued Logics
- Automata theory based on quantum logic. I
- Automata theory based on quantum logic. II.
- Automata theory based on quantum logic: Some characterizations
- Automata theory based on unsharp quantum logic
- Characterizing the super-Turing computing power and efficiency of classical fuzzy Turing machines
- Effect algebras and unsharp quantum logics.
- Generalization of blocks for \(D\)-lattices and lattice-ordered effect algebras
- scientific article; zbMATH DE number 1688754 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 1930741 (Why is no real title available?)
- scientific article; zbMATH DE number 3804225 (Why is no real title available?)
- scientific article; zbMATH DE number 5182234 (Why is no real title available?)
- scientific article; zbMATH DE number 3027414 (Why is no real title available?)
- Lattices of quantum automata
- Quantum automata and quantum grammars
- Quantum MV algebras
- Quantum MV-algebras and commutativity
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Reasoning in quantum theory. Sharp and unsharp quantum logics.
- The logic of quantum mechanics
This page was built for publication: The computing power of Turing machine based on quantum logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6874942)
