Characterizations of semicomputable sets of real numbers
DOI10.1016/J.JLAP.2013.11.001zbMATH Open1307.68028OpenAlexW2014332513MaRDI QIDQ478399FDOQ478399
Authors: Bo Xie, Ming Quan Fu, Jeffery Zucker 
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
Recommendations
computability on realscomputability on topological algebrasEngeler's lemmasemicomputable sets of reals
Theory of programming languages (68N15) Computation over the reals, computable analysis (03D78) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Abstract data types; algebraic specification (68Q65) Applications of universal algebra in computer science (08A70)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Abstract versus concrete computation on metric partial algebras
- Continuity of operators on continuous and discrete time streams
- Title not available (Why is that?)
Cited In (4)
This page was built for publication: Characterizations of semicomputable sets of real numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q478399)
