Results 1 
5 of
5
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 lcalculus (or LISP). We have adapted the "toy RISC" machine of [Hernndez & Hernndez 1993] ..."
Abstract

Cited by 30 (17 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 lcalculus (or LISP). We have adapted the "toy RISC" machine of [Hernndez & Hernndez 1993] with two remarkable features inherited from its objectoriented 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 5 (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 bitbybit 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, generalpurpose 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 onedimensional 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.
Joint Encryption & Compression using Variable Model Arithmetic Coding
"... Past research in the field of cryptography has not given much consideration to arithmetic coding as a feasible encryption technique. Over the past few years, while arithmetic coding has still been the focus of a lot of intense research, studies have proven compressionspecific arithmetic coding to b ..."
Abstract
 Add to MetaCart
Past research in the field of cryptography has not given much consideration to arithmetic coding as a feasible encryption technique. Over the past few years, while arithmetic coding has still been the focus of a lot of intense research, studies have proven compressionspecific arithmetic coding to be largely unsuitable for encryption. This is in spite of the large size of the model that arithmetic coding works with. Adaptive modelling, in particular, offers a huge model, variable in structure, and as completely as possible a function of the entire text that has been transmitted since the time the model was initialized. This serves as a huge key, which can make decryption arbitrarily difficult. But the scheme has been shown to be vulnerable to organized cryptanalysis. The focus of the work presented in this paper has been to incorporate the results of chaos theory into arithmetic coding, to device a convenient method to make the structure of the model unpredictable and variable in nature, and yet to retain, as far as is possible, statistical harmony, so that compression is possible. A chaosbased adaptive arithmetic codingencryption technique has been designed, developed and tested and its implementation has been discussed. For typical text files, the proposed encoder gives compression between 67.5 and 70.5 % and is not susceptible to previously carried out attacks on arithmetic coding algorithms.
dpersistent
, 2007
"... Adaptive stabilization of nonlinear systems at unknown equilibrium points: an invariant manifold and uniform ..."
Abstract
 Add to MetaCart
Adaptive stabilization of nonlinear systems at unknown equilibrium points: an invariant manifold and uniform