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 infinite-time-computability
Search options not deleted
user 14490
2
votes
Accepted
On a characterization of the recursively inaccessible ordinals
Well assuming that $\lambda^A$ is always the first recursively admissible which is bigger than $\omega_1^A$, which I think should be true, I think my question is after all not so interesting:
Either …
- 764
5
votes
1
answer
617
views
On a characterization of the recursively inaccessible ordinals
For a given set of numbers $A$, let $O^A$ be the hyperjump of $A$. It is possible to iterate inductively the hyperjump of a set, through the computable ordinals, in a way that the $\alpha$-th hyperjum …
- 764