For a computable binary tree, is having no computable branches the same as having no probabilistic algorithm for producing branches? – mathoverflow.net

For a computable binary tree, is having no computable branches the same as having no probabilistic algorithm for producing branches? – mathoverflow.net

11:09 No Comments
It is a classical result of computability theory that there is a computable infinite binary tree $T\subset 2^{<\omega}$ with no computable infinite branch. One way to construct such a tree is to ...

from Hot Questions - Stack Exchange OnStackOverflow
via Blogspot

Share this

Unknown

0 Comment to "For a computable binary tree, is having no computable branches the same as having no probabilistic algorithm for producing branches? – mathoverflow.net"

Post a Comment

Subscribe to: Post Comments (Atom)