  Following work by Hochman and Meyerovitch on multidimensional SFT, we give
computability-theoretic characterizations of the real numbers that can appear
as the topological entropies of one-dimensional and two-dimensional cellular
automata.
