Why does the probabilistic abacus work?

DOI10.1007/BF00144359zbMath0338.60041MaRDI QIDQ1231228

Arthur Engel

Publication date: 1976

Published in: Educational Studies in Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20)

Related Items (13)

Dynamic graph models and their properties ⋮ “Pass the Buck” on a Complete Binary Tree ⋮ “Pass the Buck” on a Rooted Tree ⋮ A greedy chip‐firing game ⋮ Results in labeled chip-firing ⋮ Compatible recurrent identities of the sandpile group and maximal stable configurations ⋮ Chip-firing games on directed graphs ⋮ Passing the Buck and Firing Fibonacci: Adventures with the Stochastic Abacus ⋮ Goldbug variations ⋮ Sorting via chip-firing ⋮ Sorting via chip-firing ⋮ Root system chip-firing. I: Interval-firing ⋮ Discrete analog computing with rotor-routers

Cites Work

• The probabilistic abacus
• Unnamed Item

This page was built for publication: Why does the probabilistic abacus work?