Paraconsistent Machines and their Relation to Quantum Computing

DOI10.1093/logcom/exp072zbMath1196.03053arXiv0802.0150OpenAlexW1980401455MaRDI QIDQ3553921

Juan C. Agudelo, Walter Alexandre Carnielli

Publication date: 21 April 2010

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0802.0150

zbMATH Keywords

quantum computationentangled statesDeutsch-Jozsa problemDeutsch's problemparaconsistent computationparaconsistent Turing machines

Mathematics Subject Classification ID

Quantum computation (81P68) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Paraconsistent logics (03B53) Turing machines and related notions (03D10)

Related Items (4)

Paraconsistent Transition Systems ⋮ Multimodal incompleteness under weak negations ⋮ Paraconsistent Computation and Dialetheic Machines ⋮ On the Philosophy and Mathematics of the Logics of Formal Inconsistency

This page was built for publication: Paraconsistent Machines and their Relation to Quantum Computing