A foundation for computable analysis
This paper gives a short survey of the Type Two Theory of Effectivity, or TTE for short, and shows its general applicability by examples. In TTE, Turing computability is generalized from finite to infinite sequences of symbols, which computers can handle. Infinite sequences of symbols are then used as names for infinite objects such as real numbers, open sets, compact sets or continuous functions. Naming systems are called representations. A general concept of ``admissible (effective) representations for \(T_0\)-spaces with countable bases is introduced in the paper. For ``admissible representations every computable function is continuous. Thus in TTE, ``continuous is interpreted as ``constructive. Through examples the paper shows that by using representations, effectivity can be studied on the real numbers, compact sets, continuous functions, and many other spaces used in analysis. The paper also gives a brief discussion on computational complexity for Type 2 machines and other infinite sets via representations. For the entire collection see [Zbl 0877.00007].
- A foundation for computable analysis
- scientific article; zbMATH DE number 1222088
- scientific article; zbMATH DE number 2013199
- Foundational analyses of computation
- scientific article; zbMATH DE number 1460545
- A tutorial on computable analysis
- New Computational Paradigms
- Computability in analysis
- Computability in analysis
- Constructive mathematics: a foundation for computable analysis
- Admissible representations of effective cpo's
- Constructive mathematics: a foundation for computable analysis
- Comparing representations for function spaces in computable analysis
- Topological analysis of representations
- Abstract geometrical computation. V: Embedding computable analysis
- Computability on computable metric spaces
- Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computations
- Between Turing and Kleene
- Representations of measurable sets in computable measure theory
- Small complexity classes for computable analysis
- Computability in analysis
- Alan Turing and the foundations of computable analysis
- The computable multi-functions on multi-represented sets are closed under programming
- scientific article; zbMATH DE number 3952751 (Why is no real title available?)
- scientific article; zbMATH DE number 1222088 (Why is no real title available?)
- scientific article; zbMATH DE number 551031 (Why is no real title available?)
- A foundation for computable analysis
- scientific article; zbMATH DE number 2013199 (Why is no real title available?)
- scientific article; zbMATH DE number 1460545 (Why is no real title available?)
- A comparison of concepts from computable analysis and effective descriptive set theory
- A simple and powerful approach for studying constructivity, computability, and complexity
- Closed sets and operators thereon: representations, computability and complexity
- Computable analysis and notions of continuity in \textsc{Coq}
- Notes on computable analysis
- Computer Science Logic
- Absolutely Non-effective Predicates and Functions in Computable Analysis
- scientific article; zbMATH DE number 3322506 (Why is no real title available?)
- New Computational Paradigms
- Logical Approaches to Computational Barriers
- The weak-operator sequential continuity of left multiplication
This page was built for publication: A foundation for computable analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4371021)
