Paraconsistent Turing machines: analysis and perspective

• Grant number: 16/16273-4
• Support Opportunities: Scholarships in Brazil - Scientific Initiation
• Start date: November 01, 2016
• End date: October 31, 2017
• Field of knowledge: Humanities - Philosophy - Logic
• Principal Investigator: Mariana Matulovic da Silva Rodrigueiro
• Grantee: Bruna Luiza Bispo
• Host Institution: Faculdade de Ciências e Engenharia. Universidade Estadual Paulista (UNESP). Campus de Tupã. Tupã , SP, Brazil

Abstract

Inspired by the machine model devised by Alan Turing, Juan Carlos Agudelo outlines a machine that accepts a set of commands to be executed simultaneously. For this to be possible, since the classic logical system does not conceive the possibility of working with superposed states, a new logical system was implemented by the author in the version of paraconsistent logic and paraconsistent circuits are proposed from a generalization of Boolean classic circuits. This research project aims to analyze the theoretical basis underlying the design of a Paraconsistent Turing machine. (AU)