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 trees
Search options not deleted
user 23648
A tree is a connected graph without cycles, with a finite or infinite number of vertices. There are many variants of trees, according to further constraints or decorations.
1
vote
0
answers
97
views
Name For Effective Cantor-Bendixsonish Derivitive
When dealing with a tree (substring closed subset of $\omega^{< \omega})$ a useful operation will frequently be to remove any nodes with finite ordinal rank (i.e., all nodes whose extensions on the tr …
- 3,029
1
vote
Properties of all relatively computable branches
Dan's idea above is good but he made a tiny mistake that left $T$ non-perfect so I figured I'd fix that and at the same time give a solution that doesn't use machinery from randomness.
Build r.e sets …
- 3,029
4
votes
2
answers
126
views
Properties of all relatively computable branches
I'm probably just missing something obvious but suppose that $T \subset 2^{< \omega}$ is a perfect tree with no terminal nodes (what about just $[T]$ non-empty?). If $Y \leq_{T} X$ for all $X \in [ …
- 3,029
1
vote
0
answers
73
views
Standard terminology for node in tree with multiple children
Is there a standard terminology for a node in a tree that has multiple children?
For instance, in describing in perfect tree in $\omega^{< \omega}$ how would you describe the nodes that are extended b …
- 3,029