subrecursive en · ADJ
Etymology
From sub- + recursive.
Meanings
-
(not-comparable) Able to be expressed in a language or by a set of operations that is a proper subset of the expressiveness of a Turing machine.
We also prove computability of F\o lner sets for a group that is extension of an amenable group with solvable word problem by a finitely generated group with computable F\o lner sets with subrecursive distortion function.
2016, Matteo Cavaleri, “Computability of Følner sets”, in arXiv: