More than ten years have passed since my book Computable Analysis Computable Analysis has appeared in print. Meanwhile the representation approach, TTE, has been used to study computability in many applications. But it has turned out that in the book some basic concepts are not quite adequate, that many theorems are not sufficiently general and that some tools are not sufficiently powerful for rigorous proofs. The following three (free open access) articles may remedy some of these deficiencies.

The "flowcharts with indirect addressing" used in the second article are unwieldy. Corresponding theorems are proved for the much simpler model of "Turing machines on represented sets" in the third article. Therefore, the reader can ignore Sections 4,5,7 and 8 (from Thm 30) in the second article. Further explanations