ABSTRACT
The algorithms of Chapters 3 and 5 are not restricted in theory to discrete state spaces, but the examples presented therein were all discrete. This is because the problem of designing a chain that coalesces down to a single state can be trickier when Ω is a continuous state space. Trickier, but not impossible, and in this chapter several methods for dealing with continuous state spaces are considered.
