We would like to welcome Arno Pauly, who has recently joined the computer science department here in Swansea. Today he is going to give a talk on Noncomputability in analysis as a part of our Computational Foundry Seminar Series.
More information: Many theorems in analysis state the existence of a certain object depending on some parameter. Each such theorem has an associated computational task: Compute the object from the parameter. From the viewpoint of a constructivist, these tasks are intricately linked to the meaningful truth of the theorems. From a pragmatic perspective, the applicability of a theorem to fields like physics or economics is tied to the solvability of the associated computational task.