Computable binary tree
= Computable binary tree
= Recursive binary tree
{synonym}
A <binary tree of finite strings> is computable when membership of a finite <binary string> is decidable. An infinite computable tree need not have any computable infinite path. Removing all nodes without infinite extensions need not preserve decidability.