84 citations · 228 across the 17 of their papers we have counts for
Showing 2010Show all
2 papers · 1 filter
cs.DC2010★ 15 cited
Edge- and Node-Disjoint Paths in P Systems
Michael J. Dinneen, Yun-Bum Kim, Radu Nicolescu
In this paper, we continue our development of algorithms used for topological network discovery. We present native P system versions of two fundamental problems in graph theory: fi…
quant-ph2010★ 84 cited
Experimental Evidence of Quantum Randomness Incomputability
Cristian S. Calude, Michael J. Dinneen, Monica Dumitrescu +1
In contrast with software-generated randomness (called pseudo-randomness), quantum randomness is provable incomputable, i.e.\ it is not exactly reproducible by any algorithm. We pr…