"subrecursive" meaning in All languages combined

See subrecursive on Wiktionary

Adjective [English]

Rhymes: -ɜː(ɹ)sɪv Etymology: From sub- + recursive. Etymology templates: {{prefix|en|sub|recursive}} sub- + recursive Head templates: {{en-adj|-}} subrecursive (not comparable)
  1. (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 Categories (topical): Mathematics
{
  "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": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "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": "topical",
          "langcode": "en",
          "name": "Mathematics",
          "orig": "en:Mathematics",
          "parents": [
            "Formal sciences",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "examples": [
        {
          "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": [
        {
          "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"
}

Download raw JSONL data for subrecursive meaning in All languages combined (1.5kB)


This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2025-02-12 from the enwiktionary dump dated 2025-02-02 using wiktextract (1c4b89b and 9dbd323). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.

If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.