On the algebraic numbers computable by some generalized Ehrenfest urns

Details On the algebraic numbers computable by some generalized Ehrenfest urns On the algebraic numbers computable by some generalized Ehrenfest urns

2011-04-29

arxiv.org/abs/1104.5643v1

Computer Science

Distributed, Parallel, and Cluster Computing

Scientific paper

This article deals with some stochastic population protocols, motivated by theoretical aspects of distributed computing. We modelize the problem by a large urn of black and white balls from which at every time unit a fixed number of balls are drawn and their colors are changed according to the number of black balls among them. When the time and the number of balls both tend to infinity the proportion of black balls converges to an algebraic number. We prove that, surprisingly enough, not every algebraic number can be "computed" this way.

Affiliated with

Also associated with

No associations

Rating

On the algebraic numbers computable by some generalized Ehrenfest urns does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the algebraic numbers computable by some generalized Ehrenfest urns, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the algebraic numbers computable by some generalized Ehrenfest urns will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-17946