Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computations

DOI10.1016/j.tcs.2004.03.026zbMath1061.03075OpenAlexW2015307217WikidataQ61927045 ScholiaQ61927045MaRDI QIDQ1885034

Verónica Becher, Serge Grigorieff

Publication date: 27 October 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.03.026

zbMATH Keywords

continuitysemicontinuitycomputabilitysemicomputabilityinfinite computationmonotone Turing machines

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) Turing machines and related notions (03D10) Theory of numerations, effectively presented structures (03D45) Hierarchies of computability and definability (03D55)

Related Items

Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computations ⋮ Towards a descriptive set theory for domain-like structures ⋮ Preface ⋮ Random reals and possibly infinite computations Part I: Randomness in ∅′ ⋮ Wadge hardness in Scott spaces and its effectivization ⋮ From index sets to randomness in ∅ⁿ: random reals and possibly infinite computations part II

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Type 2 recursion theory
• Theory of representations
• Infinite-word languages and continuous mappings
• Descriptive set theory
• Adherences of languages
• Classical recursion theory. The theory of functions and sets of natural numbers
• \(X\)-automata on \(\omega\)-words
• Algorithmic entropy of sets
• Recursive characterization of computable real-valued functions and relations
• Computability on computable metric spaces
• Computable functionals of finite types
• Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computations
• Process complexity and effective random tests
• Type 2 computational complexity of functions on Cantor's space
• On degrees of unsolvability
• Wadge hierarchy and Veblen hierarchy Part I: Borel sets of finite rank
• Computable functionals
• On the definition of computable functionals
• On computable sequences
• On the definitions of computable real continuous functions
• Computability theory of generalized functions
• The topological structure of adherences of regular languages
• Rekursive Folgenmengen I
• A Theory of Program Size Formally Identical to Information Theory
• Arithmetische Operatoren
• Kolmogorov complexity and set theoretical representations of integers
• Compact zero-dimensional metric spaces of finite type
• Random reals and possibly infinite computations Part I: Randomness in ∅′
• On Computable Numbers, with an Application to the Entscheidungsproblem