|
| | | | |
| | | |
| Stat |
Members: 3645
Articles: 2'504'928
Articles rated: 2609
26 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
The Cardinality of an Oracle in Blum-Shub-Smale Computation | | Wesley Calvert
; Ken Kramer
; Russell Miller
; | | Date: |
2 Jun 2010 | | Abstract: | We examine the relation of BSS-reducibility on subsets of the real numbers.
The question was asked recently (and anonymously) whether it is possible for
the halting problem H in BSS-computation to be BSS-reducible to a countable
set. Intuitively, it seems that a countable set ought not to contain enough
information to decide membership in a reasonably complex (uncountable) set such
as H. We confirm this intuition, and prove a more general theorem linking the
cardinality of the oracle set to the cardinality, in a local sense, of the set
which it computes. We also mention other recent results on BSS-computation and
algebraic real numbers. | | Source: | arXiv, 1006.0396 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER