Advertisement
Published in:
2007 | OriginalPaper | Chapter
Unconventional Models of Computation Through Non-standard Logic Circuits
Authors : Juan C. Agudelo, Walter Carnielli
Published in: Unconventional Computation
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.