Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with overt-spaces
Search options answers only
not deleted
user 1946
Overtness is the lattice dual of compactness in various forms of constructive topology and analysis, where related ideas are also called "located" (constructive analysis), "recursively enumerable" (computable analysis), "open" (locale theory) or "positive" (formal topology).
31
votes
Accepted
Intermediate value theorem on computable reals
Let me assume that you are speaking about computable reals and functions in the sense of
computable analysis, which is one of the most successful approaches to the topic. (One must be careful, since t …
- 2,031