给予一个为初始点的有理坐标是周期性，决定位于basin of attraction是否开集，或是否在平分线函数迭代为两个纲比或三个纲比。
^ Stallworth, Daniel T. and Fred W. RoushAn Undecidable Property of Definite Integrals Proceedings of the American Mathematical Society Volume 125, Number 7, July 1997, Pages 2147-2148
Brookshear, J. Glenn. Theory of Computation: Formal Languages, Automata, and Complexity. Redwood City, California: Benjamin/Cummings Publishing Company, Inc. 1989. Appendix C includes impossibility of algorithms deciding if a grammar contains ambiguities, and impossibility of verifying program correctness by an algorithm as example of Halting Problem.
Halava, Vesa. Decidable and undecidable problems in matrix theory. TUCS technical report 127. Turku Centre for Computer Science. 1997.
B. M. E. Moret, H. D. Shapiro. Algorithms from P to NP, volume 1 - Design and Efficiency. Redwood City, California: Benjamin/Cummings Publishing Company, Inc. 1991. Discusses intractability of problems with algorithms having exponential performance in Chapter 2, "Mathematical techniques for the analysis of algorithms."
Weinberger, Shmuel. Computers, rigidity, and moduli. Princeton, NJ: Princeton University Press. 2005. Discusses undecidability of the word problem for groups, and of various problems in topology.