Computability of Percolation Thresholds
Book chapter, 2008

The critical value for Bernoulli percolation on the ℤd lattice in any dimension d is shown to be a computable number in the sense of the Church-Turing thesis

Percolation

Church-Turing computability

renormalization

critical value

Author

Olle Häggström

University of Gothenburg

Chalmers, Mathematical Sciences, Mathematical Statistics

In and Out of Equilibrium 2

Vol. 60 321-329

Subject Categories

Probability Theory and Statistics

Computer Science

DOI

10.1007/978-3-7643-8786-0_16

More information

Latest update

7/12/2024