Results 1 -
3 of
3
A Formal Definition of Intelligence Based on an Intensional Variant of Algorithmic Complexity
- In Proceedings of the International Symposium of Engineering of Intelligent Systems (EIS'98
, 1998
"... Machine Due to the current technology of the computers we can use, we have chosen an extremely abridged emulation of the machine that will effectively run the programs, instead of more proper languages, like l-calculus (or LISP). We have adapted the "toy RISC" machine of [Hernndez & Hernndez 1993] ..."
Abstract
-
Cited by 20 (10 self)
- Add to MetaCart
Machine Due to the current technology of the computers we can use, we have chosen an extremely abridged emulation of the machine that will effectively run the programs, instead of more proper languages, like l-calculus (or LISP). We have adapted the "toy RISC" machine of [Hernndez & Hernndez 1993] with two remarkable features inherited from its object-oriented coding in C++: it is easily tunable for our needs, and it is efficient. We have made it even more reduced, removing any operand in the instruction set, even for the loop operations. We have only three registers which are AX (the accumulator), BX and CX. The operations Q b we have used for our experiment are in Table 1: LOOPTOP Decrements CX. If it is not equal to the first element jump to the program top.
Chaos Computing: Implementation of Fundamental Logical Gates by Chaotic Elements
, 2002
"... Basic principles of implementing the most fundamental computing functions by chaotic elements are described. They provide a theoretical foundation of computer architecture based on a totally new principle other than silicon chips. The fundamental functions are: the logical AND, OR, NOT, XOR, and NAN ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
Basic principles of implementing the most fundamental computing functions by chaotic elements are described. They provide a theoretical foundation of computer architecture based on a totally new principle other than silicon chips. The fundamental functions are: the logical AND, OR, NOT, XOR, and NAND operations (gates) and bit-by-bit arithmetic operations. Each of the logical operations is realized by employing a single chaotic element. Computer memory can be constructed by combining logical gates. With these fundamental ingredients in hand, it is conceivable to build a simple, fast, yet cost effective, general-purpose computing device. Chaos computing may also lead to dynamic architecture, where the hardware design itself evolves during the course of computation. The basic ideas are explained by employing a one-dimensional model, specifically the logistic map.
On the Application of Kolmogorov Complexity to
"... This paper presents a proposal for the application of Kolmogorov complexity to the characterization of systems and processes, and the evaluation of computational models. The methodology developed represents a theoretical tool to solve problems from systems science. Two applications of the methodolog ..."
Abstract
- Add to MetaCart
This paper presents a proposal for the application of Kolmogorov complexity to the characterization of systems and processes, and the evaluation of computational models. The methodology developed represents a theoretical tool to solve problems from systems science. Two applications of the methodology are presented in order to illustrate the proposal, both of which were developed by the authors. The first one is related to the software development process, the second to computer animation models. In the end a third application of the method is briefly introduced, with the intention of characterizing dynamic systems of chaotic behavior, which clearly demonstrates the potentials of the methodology.

