A Note on the Differences of Computably Enumerable Reals

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-319-50062-1_37
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer International Publishing

Related search

Recursively Enumerable Reals and Chaitin Ω Numbers

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2001English

Book Review: Recursively Enumerable Sets and Degrees: A Study of Computable Functions and Computably Generated Sets

Bulletin of the American Mathematical Society
MathematicsApplied Mathematics
1988English

Measures of Graphs on the Reals

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1990English

On Uncountable Strongly Concentrated Sets of Reals

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
2018English

Two Notes on Recursively Enumerable Sets

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1953English

Towards a Compiler for Reals

ACM Transactions on Programming Languages and Systems
Software
2017English

The Undecidability of the Recursively Enumerable Degrees

Bulletin of the American Mathematical Society
MathematicsApplied Mathematics
1982English

Computable Decision Making on the Reals and Other Spaces

2018English

Isomorphisms of Lexicographic Powers of the Reals

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1995English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy