|
| |
|
| |
|
| |
|
|
Super-Turing Computational Potential of Cognitive and Evolutionary Systems
Wiedermann, Jiří
The computational potential of artificial living systems is investigated. Each organism is modelled by so-called cognitive automaton. It is any finite state device with a finite configuration space that processes infinite streams of input symbols. Examples of such automata are finite state automata, discrete neural networks, Boolean circuits, etc. It is shown that non-uniform families of cognitive automata and community of cognitive automata possess a super-Turing computing potential.
|
|
| |
|
| |
|
| |
|
| |
|
|
Associativity in Combination of Belief Functions
Daniel, Milan
The nature of a contradiction (conflict) between two belief functions is investigated. Alternative ways of distribution of the contradiction among nonempty subsets of frame of discernment are studied. A new approach to understanding of the contradiction is used and an original notion of a potential contradiction is introduced. A new way of an associative combination of generalized belief functions is presented. A way of its proportionalization is suggested as well.
|
|
| |
guest ::
