Unconventional models of computation through non-standard logic circuits

Authors:
Juan C. Agudelo;Walter Carnielli
Affiliations:
Ph.D. Program in Philosophy/Logic, IFCH and Group for Applied and Theoretical Logic- CLE, State University of Campinas - UNICAMP, Brazil;IFCH and Group for Applied and Theoretical Logic- CLE, State University of Campinas - UNICAMP, Brazil and SQIG - IT, Portugal
Venue:
UC'07 Proceedings of the 6th international conference on Unconventional Computation
Year:
2007

Citing 5
Cited 0

Computability and logic: 3rd ed.

Computability and logic: 3rd ed.
Quantum computation and quantum information

Quantum computation and quantum information
Hypercomputation

Minds and Machines
The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Polynomial Ring Calculus for Many-Valued Logics

ISMVL '05 Proceedings of the 35th International Symposium on Multiple-Valued Logic

Quantified Score

Hi-index	0.00

Visualization

Abstract

The classical (boolean) circuit model of computation is generalized via polynomial ring calculus, an algebraic proof method adequate to non-standard logics (namely, to all truth-functional propositional logics and to some non-truth-functional logics). Such generalization allows us to define models of computation based on non-standard logics in a natural way by using 'hidden variables' in the constitution of the model. Paraconsistent circuits for the paraconsistent logic mbC (and for some extensions) are defined as an example of such models. Some potentialities are explored with respect to computability and computational complexity.