Computing power of Turing machines in the framework of unsharp quantum logic (Q496026): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Ru-qian Lu / rank
Normal rank
 
Property / author
 
Property / author: Ru-qian Lu / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2014.12.015 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2015519619 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Complexity Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic Analysis of Many Valued Logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reasoning in quantum theory. Sharp and unsharp quantum logics. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum theory, the Church–Turing principle and the universal quantum computer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2762622 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effect algebras and unsharp quantum logics. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum MV algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum MV-algebras and commutativity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5592246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattices of quantum automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4747069 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum automata and quantum grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial Observation of Quantum Turing Machines and a Weaker Well-Formedness Condition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classically controlled quantum computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4710019 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata theory based on quantum logic: Some characterizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata theory based on quantum logic: reversibilities and pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Notes on automata theory based on quantum logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5418251 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalization of blocks for \(D\)-lattices and lattice-ordered effect algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata theory based on unsharp quantum logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of computation based on unsharp quantum logic: finite state automata and pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040892 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5317671 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing the super-Turing computing power and efficiency of classical fuzzy Turing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata theory based on quantum logic. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata theory based on quantum logic. II. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of computation based on quantum logic. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5427877 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:25, 10 July 2024

scientific article
Language Label Description Also known as
English
Computing power of Turing machines in the framework of unsharp quantum logic
scientific article

    Statements

    Computing power of Turing machines in the framework of unsharp quantum logic (English)
    0 references
    0 references
    0 references
    0 references
    16 September 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Turing machines
    0 references
    unsharp quantum logic
    0 references
    computational power
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references