"subrecursive" meaning in English

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "sub",
        "3": "recursive"
      },
      "expansion": "sub- + recursive",
      "name": "prefix"
    }
  ],
  "etymology_text": "From sub- + recursive.",
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "subrecursive (not comparable)",
      "name": "en-adj"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "adj",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English terms prefixed with sub-",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "langcode": "en",
          "name": "Mathematics",
          "orig": "en:Mathematics",
          "parents": [],
          "source": "w"
        }
      ],
      "examples": [
        {
          "bold_text_offsets": [
            [
              188,
              200
            ]
          ],
          "ref": "2016, Matteo Cavaleri, “Computability of Følner sets”, in arXiv:",
          "text": "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.",
          "type": "quote"
        }
      ],
      "glosses": [
        "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."
      ],
      "id": "en-subrecursive-en-adj-yzuffdEn",
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "Turing machine",
          "Turing machine"
        ]
      ],
      "raw_glosses": [
        "(mathematics) 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."
      ],
      "tags": [
        "not-comparable"
      ],
      "topics": [
        "mathematics",
        "sciences"
      ]
    }
  ],
  "sounds": [
    {
      "rhymes": "-ɜː(ɹ)sɪv"
    }
  ],
  "word": "subrecursive"
}

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "sub",
        "3": "recursive"
      },
      "expansion": "sub- + recursive",
      "name": "prefix"
    }
  ],
  "etymology_text": "From sub- + recursive.",
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "subrecursive (not comparable)",
      "name": "en-adj"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "adj",
  "senses": [
    {
      "categories": [
        "English adjectives",
        "English entries with incorrect language header",
        "English lemmas",
        "English terms prefixed with sub-",
        "English terms with quotations",
        "English uncomparable adjectives",
        "Pages with 1 entry",
        "Pages with entries",
        "Rhymes:English/ɜː(ɹ)sɪv",
        "en:Mathematics"
      ],
      "examples": [
        {
          "bold_text_offsets": [
            [
              188,
              200
            ]
          ],
          "ref": "2016, Matteo Cavaleri, “Computability of Følner sets”, in arXiv:",
          "text": "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.",
          "type": "quote"
        }
      ],
      "glosses": [
        "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."
      ],
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "Turing machine",
          "Turing machine"
        ]
      ],
      "raw_glosses": [
        "(mathematics) 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."
      ],
      "tags": [
        "not-comparable"
      ],
      "topics": [
        "mathematics",
        "sciences"
      ]
    }
  ],
  "sounds": [
    {
      "rhymes": "-ɜː(ɹ)sɪv"
    }
  ],
  "word": "subrecursive"
}