A random number generator is proposed based on a theorem about existence of chaos in fixed point iteration of xn = cot(xn−1). Digital computer simulation of this function iteration exhibits random… (More)

Asymptotic notations are heavily used while analysing runtimes of algorithms. Present paper argues that some of these usages are non trivial, therefore incurring errors in communication of ideas.… (More)

It has been demonstrated earlier that universal computation is ‘almost surely’ chaotic. Machine learning is a form of computational fixed point iteration, iterating over the computable function… (More)

A lot of formal and informal recreational study took place in the fields of Meromorphic Maps, since Mandelbrot popularized the map z ← z + c. An immediate generalization of the Mandelbrot z ← z + c… (More)

There are enormous amount of examples of Computation in nature, exemplified across multiple species in biology. One crucial aim for these computations across all life forms their ability to learn and… (More)

Dynamical Systems theory generally deals with fixed point iterations of continuous functions. Computation by Turing machine although is a fixed point iteration but is not continuous. This specific… (More)

nJexl is a derivative of Apache Jexl project [1]. The motivation for nJexl are domain specific languages (DSL) like VERILOG [2], VHDL [3], Spice [4]. DSL for Software testing is not a new idea, many… (More)

Fixed point iterations are known to generate chaos, for some values in their parameter range. It is an established fact that Turing Machines are fixed point iterations. However, as these Machines… (More)