Subrecursive

adj

adj ·Rare ·Advanced level

Definitions

Adjective
  1. 1
    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. not-comparable

    "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."

Example

More examples

"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."

Etymology

From sub- + recursive.

Data sourced from Wiktionary, WordNet, CMU, and other open linguistic databases. Updated March 2026.