Computability
Keyword(s):
This chapter develops the basic results of computability theory, many of which are about noncomputable sequences and sets, with the goal of revealing the limits of computable analysis. Two of the key examples are a bounded computable sequence of rational numbers whose limit is not computable, and a computable tree with no computable infinite path. Computability is an unusual mathematical concept, because it is most easily used in an informal way. One often talks about it in terms of human activities, such as making lists, rather than by applying a precise definition. Nevertheless, there is a precise definition of computability, so this informal description of computations can be formalized.
2019 ◽
pp. 447-608
2019 ◽
pp. 260-385
1977 ◽
Vol 35
◽
pp. 408-409
Keyword(s):
2019 ◽
Vol 53
(1)
◽
pp. 23-32
1991 ◽
Vol 15
(2)
◽
pp. 22-33