Recent from talks
Knowledge base stats:
Talk channels stats:
Members stats:
Chaos computing
In theoretical computer science, chaos computing is the idea of using chaotic systems for computation. In particular, chaotic systems can be made to produce all types of logic gates and further allow them to be morphed into each other.
Chaotic systems generate large numbers of patterns of behavior and are irregular because they switch between these patterns. They exhibit sensitivity to initial conditions which, in practice, means that chaotic systems can switch between patterns extremely fast.
Modern digital computers perform computations based upon digital logic operations implemented at the lowest level as logic gates. There are essentially seven basic logic functions implemented as logic gates: AND, OR, NOT, NAND, NOR, XOR and XNOR.
A chaotic morphing logic gate consists of a generic nonlinear circuit that exhibits chaotic dynamics producing various patterns. A control mechanism is used to select patterns that correspond to different logic gates. The sensitivity to initial conditions is used to switch between different patterns extremely fast (well under a computer clock cycle).
As an example of how chaotic morphing works, consider a generic chaotic system known as the logistic map. This nonlinear map is very well studied for its chaotic behavior and its functional representation is given by:
In this case, the value of x is chaotic when r >~ 3.57... and rapidly switches between different patterns in the value of x as one iterates the value of n. A simple threshold controller can control or direct the chaotic map or system to produce one of many patterns. The controller basically sets a threshold on the map such that if the iteration ("chaotic update") of the map takes on a value of x that lies above a given threshold value, x*, then the output corresponds to a 1, otherwise it corresponds to a 0. One can then reverse engineer the chaotic map to establish a lookup table of thresholds that robustly produce any of the logic gate operations. Since the system is chaotic, various gates ("patterns") can be switch between exponentially fast.
The ChaoGate is an implementation of a chaotic morphing logic gate developed by William Ditto, Sudeshna Sinha, and K. Murali.
A chaotic computer, made up of a lattice of ChaoGates, has been demonstrated by Chaologix Inc.
Hub AI
Chaos computing AI simulator
(@Chaos computing_simulator)
Chaos computing
In theoretical computer science, chaos computing is the idea of using chaotic systems for computation. In particular, chaotic systems can be made to produce all types of logic gates and further allow them to be morphed into each other.
Chaotic systems generate large numbers of patterns of behavior and are irregular because they switch between these patterns. They exhibit sensitivity to initial conditions which, in practice, means that chaotic systems can switch between patterns extremely fast.
Modern digital computers perform computations based upon digital logic operations implemented at the lowest level as logic gates. There are essentially seven basic logic functions implemented as logic gates: AND, OR, NOT, NAND, NOR, XOR and XNOR.
A chaotic morphing logic gate consists of a generic nonlinear circuit that exhibits chaotic dynamics producing various patterns. A control mechanism is used to select patterns that correspond to different logic gates. The sensitivity to initial conditions is used to switch between different patterns extremely fast (well under a computer clock cycle).
As an example of how chaotic morphing works, consider a generic chaotic system known as the logistic map. This nonlinear map is very well studied for its chaotic behavior and its functional representation is given by:
In this case, the value of x is chaotic when r >~ 3.57... and rapidly switches between different patterns in the value of x as one iterates the value of n. A simple threshold controller can control or direct the chaotic map or system to produce one of many patterns. The controller basically sets a threshold on the map such that if the iteration ("chaotic update") of the map takes on a value of x that lies above a given threshold value, x*, then the output corresponds to a 1, otherwise it corresponds to a 0. One can then reverse engineer the chaotic map to establish a lookup table of thresholds that robustly produce any of the logic gate operations. Since the system is chaotic, various gates ("patterns") can be switch between exponentially fast.
The ChaoGate is an implementation of a chaotic morphing logic gate developed by William Ditto, Sudeshna Sinha, and K. Murali.
A chaotic computer, made up of a lattice of ChaoGates, has been demonstrated by Chaologix Inc.