Characterizations of semicomputable sets of real numbers

DOI10.1016/j.jlap.2013.11.001zbMath1307.68028OpenAlexW2014332513MaRDI QIDQ478399

Ming Quan Fu, Jeffery Zucker, Bo Xie

Publication date: 3 December 2014

Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlap.2013.11.001

zbMATH Keywords

computability on realscomputability on topological algebrasEngeler's lemmasemicomputable sets of reals

Mathematics Subject Classification ID

Theory of programming languages (68N15) Applications of universal algebra in computer science (08A70) Abstract data types; algebraic specification (68Q65) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Computation over the reals, computable analysis (03D78)

Related Items (1)

Generalizing Computability Theory to Abstract Algebras

Cites Work

• Continuity of operators on continuous and discrete time streams
• Concrete models of computation for topological algebras
• Computation by `While' programs on topological partial algebras
• Computable total functions on metric algebras, universal algebraic specifications and dynamical systems
• Abstract versus concrete computation on metric partial algebras
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Characterizations of semicomputable sets of real numbers