Agents in Quantum and Neural Uncertainty

Agents in Quantum and Neural Uncertainty

Germano Resconi (Catholic University Brescia, Italy) and Boris Kovalerchuk (Central Washington University, USA)
DOI: 10.4018/978-1-60566-898-7.ch004
OnDemand PDF Download:
$30.00
List Price: $37.50

Abstract

This chapter models quantum and neural uncertainty using a concept of the Agent–based Uncertainty Theory (AUT). The AUT is based on complex fusion of crisp (non-fuzzy) conflicting judgments of agents. It provides a uniform representation and an operational empirical interpretation for several uncertainty theories such as rough set theory, fuzzy sets theory, evidence theory, and probability theory. The AUT models conflicting evaluations that are fused in the same evaluation context. This agent approach gives also a novel definition of the quantum uncertainty and quantum computations for quantum gates that are realized by unitary transformations of the state. In the AUT approach, unitary matrices are interpreted as logic operations in logic computations. We show that by using permutation operators any type of complex classical logic expression can be generated. With the quantum gate, we introduce classical logic into the quantum domain. This chapter connects the intrinsic irrationality of the quantum system and the non-classical quantum logic with the agents. We argue that AUT can help to find meaning for quantum superposition of non-consistent states. Next, this chapter shows that the neural fusion at the synapse can be modeled by the AUT in the same fashion. The neuron is modeled as an operator that transforms classical logic expressions into many-valued logic expressions. The motivation for such neural network is to provide high flexibility and logic adaptation of the brain model.
Chapter Preview
Top

Concepts And Definitions

Now we will provide more formal definition of AUT concepts. It is done first for individual agents then for sets of agents. Consider a set of agents G={g1, g2,…..,gn}. Each agent gk assigns binary true/false value v∈{True, false} to proposition p. To show that v was assigned by the agent gk we use notation gk(p) = vk.

Complete Chapter List

Search this Book:
Reset