scispace - formally typeset
Open Access

Paraconsistency of Interactive Computation

Dina Goldin, +1 more
- pp 109-118
Reads0
Chats0
TLDR
It is concluded that paraconsistency is a necessary property for a logic that can model interactive computation, able to model both a fact and its negation, due to the role of the world (environment) in determining the course of the computation.
Abstract
The goal of computational logic is to allow us to model computation as well as to reason about it. We argue that a computational logic must be able to model interactive computation. We show that first-order logic cannot model interactive computation due to the incompleteness of interaction. We show that interactive computation is necessarily paraconsistent, able to model both a fact and its negation, due to the role of the world (environment) in determining the course of the computation. We conclude that paraconsistency is a necessary property for a logic that can model interactive computation.

read more

Citations
More filters
Journal ArticleDOI

Significance of Models of Computation, from Turing Model to Natural Computation

TL;DR: Present account of models of computation highlights several topics of importance for the development of new understanding of computing and its role: natural computation and the relationship between the model and physical implementation, interactivity as fundamental for computational modelling of concurrent information processing systems such as living organisms and their networks, and the new developments in logic needed to support this generalized framework.

Semantics of Information as Interactive Computation

TL;DR: Computers today are not only the calculation tools - they are directly (inter)acting in the physical world which itself may be conceived of as the universal computer (Zuse, Fredkin, Wolfram, Chaiti...) as discussed by the authors.

The Development of Models of Computation with Advances in Technology and Natural Sciences

TL;DR: The development of models of computation induces the development of technology and natural sciences and vice versa, and current state of the art oftechnology and sciences, especially networks of concurrency, are studied.

Interactive Models for Design of Software-Intensive Systems

TL;DR: By enunciating the interactive modeling principles for DSIS, this work provides a foundation on which the science of software design can be built and points out directions for future research.
References
More filters
Book

Artificial Intelligence: A Modern Approach

TL;DR: In this article, the authors present a comprehensive introduction to the theory and practice of artificial intelligence for modern applications, including game playing, planning and acting, and reinforcement learning with neural networks.
Journal ArticleDOI

On Computable Numbers, with an Application to the Entscheidungsproblem

TL;DR: This chapter discusses the application of the diagonal process of the universal computing machine, which automates the calculation of circle and circle-free numbers.

Intelligence without reason.

TL;DR: It is claimed that the state of computer architecture has been a strong influence on models of thought in Artificial Intelligence over the last thirty years.
Journal ArticleDOI

Interactive foundations of computing

TL;DR: It is shown that interaction machines cannot be described by sound and complete first-order logics, and that incompleteness is inherently necessary to realize greater expressiveness, and the robustness of interactive models in expressing open systems, programming in the large, graphical user interfaces, and agent-oriented artificial intelligence is compared to the robustity of Turing machines.
Journal ArticleDOI

Coinductive Models of Finite Computing Agents

TL;DR: The role of coinductive methods in modeling finite interactive computing agents and the impact of interactive (coinductive) models on Church's thesis and the connection between incompleteness and greater expressiveness are examined.
Related Papers (5)