Related papers: A Smoothed Analysis of the Space Complexity of Com…
This paper is motivated by a question whether it is possible to calculate a chaotic sequence efficiently, e.g., is it possible to get the $n$-th bit of a bit sequence generated by a chaotic map, such as $\beta$-expansion, tent map and…
Tent map is a discrete-time piecewise-affine I/O characteristic curve, which is used for chaos-based applications, such as true random number generation. However, tent map suffers from the inability to maintain the output state confined to…
In the implementation of discrete time chaotic systems, designers have mostly focused on the choice and synthesis of suitable nonlinear blocks, while correct and fast operation cannot neglect analog memory elements. Herein, a realization…
Large deviations in chaotic dynamics have potentially significant and dramatic consequences. We study large deviations of series of finite lengths $N$ generated by chaotic maps. The distributions generally display an exponential decay with…
Chaos reveals a fundamental paradox in the scientific understanding of Complex Systems. Although chaotic models may be mathematically deterministic, they are practically non-determinable due to the finite precision, which is inherent in all…
This paper talk about the complexity of computation by Turing Machine. I take attention to the relation of symmetry and order structure of the data, and I think about the limitation of computation time. First, I make general problem named…
This paper is a study of the dynamics of a new family of maps from the complex plane to itself, which we call twisted tent maps. A twisted tent map is a complex generalization of a real tent map. The action of this map can be visualized as…
The sequences, given by a 7D map have been analysed by means of the methods, widely used to detect chaos in the real world in order to test their sensitivity to chaotic features of a non-linear system determined by comparatively high number…
A new approach is proposed to the quantitative estimation of the complexity of multidimensional discrete sequences in terms of the shapes of their trajectories in the extended space of states. This approach is based on the study of the…
The linear complexity of a sequence $s$ is one of the measures of its predictability. It represents the smallest degree of a linear recursion which the sequence satisfies. There are several algorithms to find the linear complexity of a…
This paper describes the design of a modified tent map characterized by a uniform probability density function. The use of this map is proposed as an alternative to the tent map and the Bernoulli shift. It is shown that practical circuits…
In this paper, by using Logistic, Sine and Tent systems we define a combination chaotic system. Some properties of the chaotic system are studied by using figures and numerical results. A color image encryption algorithm is introduced based…
In this work we study the space complexity of computable real numbers represented by fast convergent Cauchy sequences. We show the existence of families of trascendental numbers which are logspace computable, as opposed to algebraic…
Chaotic logic gates or `chaogates' are a promising mixed-signal approach to designing universal computers. However, chaotic systems are exponentially sensitive to small perturbations, and the effects of noise can cause chaotic computers to…
We study the possibility of designing $N^{o(1)}$-round protocols for problems of substantially super-linear polynomial-time (sequential) complexity on the congested clique with about $N^{1/2}$ nodes, where $N$ is the input size. We show…
Consider a computer network that consists of a path with $n$ nodes. The nodes are labeled with inputs from a constant-sized set, and the task is to find output labels from a constant-sized set subject to some local constraints---more…
We give practical, efficient algorithms that automatically determine the asymptotic distributed round complexity of a given locally checkable graph problem in the $[\Theta(\log n), \Theta(n)]$ region, in two settings. We present one…
We consider the problem of scattering $n$ robots in a two dimensional continuous space. As this problem is impossible to solve in a deterministic manner, all solutions must be probabilistic. We investigate the amount of randomness (that is,…
Fundamental problems of periodicity and transient process to periodicity of chaotic trajectories in computer realization with finite computation precision is investigated by taking single and coupled Logistic maps as examples. Empirical…
We address two sets of long-standing open questions in probability theory, from a computational complexity perspective: divisibility of stochastic maps, and divisibility and decomposability of probability distributions. We prove that finite…