1 citations · 1 across the 11 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2013★ 1 cited
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…
cs.CC2011
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…