Blog

E-recursion is a notion of generalized computability theory which seeks to extend computations to allow arbitrary sets as inputs. In contrast with e.g. $ \alpha$ -recursion, it disallows unbounded search: halting computations are witnessed by well-foundedness of related trees, while for many values of $ \alpha$ well-foundedness of a given computable tree is $ \Pi^0_1$Read more