Paraconsistent Machines and their Relation to Quantum Computing

dc.creatorAgudelo, JC
dc.creatorCarnielli, W
dc.date2010
dc.dateAPR
dc.date2014-07-30T14:30:38Z
dc.date2015-11-26T17:07:40Z
dc.date2014-07-30T14:30:38Z
dc.date2015-11-26T17:07:40Z
dc.date.accessioned2018-03-28T23:56:11Z
dc.date.available2018-03-28T23:56:11Z
dc.identifierJournal Of Logic And Computation. Oxford Univ Press, v. 20, n. 2, n. 573, n. 595, 2010.
dc.identifier0955-792X
dc.identifierWOS:000276843800008
dc.identifier10.1093/logcom/exp072
dc.identifierhttp://www.repositorio.unicamp.br/jspui/handle/REPOSIP/59021
dc.identifierhttp://repositorio.unicamp.br/jspui/handle/REPOSIP/59021
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/1280172
dc.descriptionFundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
dc.descriptionWe describe a method to axiomatize computations in deterministic Turing machines (TMs). When applied to computations in non-deterministic TMs, this method may produce contradictory (and therefore trivial) theories, considering classical logic as the underlying logic. By substituting in such theories the underlying logic by a paraconsistent logic we define a new computation model, the paraconsistent Turing machine. This model allows a partial simulation of superposed states of quantum computing. Such a feature allows the definition of paraconsistent algorithms which solve (with some restrictions) the well-known Deutsch's and Deutsch-Jozsa problems. This first model of computation, however, does not adequately represent the notions of entangled states and relative phase, which are key features in quantum computing. In this way, a more sharpened model of paraconsistent TMs is defined, which better approaches quantum computing features. Finally, we define complexity classes for such models, and establish some relationships with classical complexity classes.
dc.description20
dc.description2
dc.description573
dc.description595
dc.descriptionFundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
dc.descriptionFundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
dc.descriptionFAPESP [2004/14107-2]
dc.languageen
dc.publisherOxford Univ Press
dc.publisherOxford
dc.publisherInglaterra
dc.relationJournal Of Logic And Computation
dc.relationJ. Logic Comput.
dc.rightsfechado
dc.rightshttp://www.oxfordjournals.org/access_purchase/self-archiving_policyb.html
dc.sourceWeb of Science
dc.subjectParaconsistent Turing machines
dc.subjectparaconsistent computation
dc.subjectquantum computation
dc.subjectDeutsch's problem
dc.subjectDeutsch-Jozsa problem
dc.subjectentangled states
dc.subjectTuring-machines
dc.subjectComputation
dc.subjectEntscheidungsproblem
dc.subjectLogic
dc.titleParaconsistent Machines and their Relation to Quantum Computing
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución