Recurring Dominoes: Making the Highly Undecidable Highly Understandable (Preliminary Report)

David Harel. Recurring Dominoes: Making the Highly Undecidable Highly Understandable (Preliminary Report). In Marek Karpinski, editor, Fundamentals of Computation Theory, Proceedings of the 1983 International FCT-Conference, Borgholm, Sweden, August 21-27, 1983. Volume 158 of Lecture Notes in Computer Science, pages 177-194, Springer, 1983.

Abstract

Abstract is missing.