We present a powerful approach for learning about uncomputability and undecidability in informationtheory. Our approach is to use automata from automata theory that have undecidable properties toconstruct channels for which an information-theoretic quantity is uncomputable or undecidable. Wedemonstrate this approach by showing that, for channels with memory, capacity is uncomputable andinformation-stability is undecidable.