1 citations · 1 across the 11 of their papers we have counts for
11 papers
A Formal Analysis of Iterated TDD
Hemil Ruparel, Nabarun Mondal
In this paper we formally analyze the software methodology called (iterated) Test Driven Development (TDD). We formally define Specification, Software, Testing, Equivalence Partiti…
Supervised Text Classification using Text Search
Nabarun Mondal, Mrunal Lohia
Supervised text classification is a classical and active area of ML research. In large enterprise, solutions to this problem has significant importance. This is specifically true i…
A declarative Language for Rapid Business Development
Nabarun Mondal, Jatin Puri, Mrunal Lohia
The motivation for ZoomBA are domain specific languages (DSL) like VERILOG, VHDL, Spice. DSL for Software testing is not a new idea, many commercial tools like Silk Suite use them,…
On The Dynamical Nature Of Computation
Nabarun Mondal, Partha P. Ghosh
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 continuou…
'Almost Sure' Chaotic Properties of Machine Learning Methods
Nabarun Mondal, Partha P. Ghosh
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 comput…
Another Asymptotic Notation : "Almost"
Nabarun Mondal, Partha P. Ghosh
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 communic…
Parallel Computation Is ESS
Nabarun Mondal, Partha P. Ghosh
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 a…
Invariance And Inner Fractals In Polynomial And Transcendental Fractals
Nabarun Mondal, Partha P. Ghosh
A lot of formal and informal recreational study took place in the fields of Meromorphic Maps, since Mandelbrot popularized the map z <- z^2 + c. An immediate generalization of the…
A General Class of Collatz Sequence and Ruin Problem
Nabarun Mondal, Partha P. Ghosh
In this paper we show the probabilistic convergence of the original Collatz (3n + 1) (or Hotpo) sequence to unity. A generalized form of the Collatz sequence (GCS) is proposed subs…
A Pseudo Random Number Generator from Chaos
Nabarun Mondal, Partha P. Ghosh
A random number generator is proposed based on a theorem about existence of chaos in fixed point iteration of x= cot2(x). Digital computer simulation of this function iteration exh…
Universal Computation Is 'Almost Surely' Chaotic
Nabarun Mondal, Partha P. Ghosh
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…