"paddable" meaning in All languages combined

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "pad",
        "3": "able"
      },
      "expansion": "pad + -able",
      "name": "suffix"
    }
  ],
  "etymology_text": "pad + -able",
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "paddable (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 suffixed with -able",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Theory of computing",
          "orig": "en:Theory of computing",
          "parents": [
            "Computer science",
            "Computing",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "examples": [
        {
          "ref": "2015, Scott Aaronson, Shalev Ben-David, “Sculpting Quantum Speedups”, in arXiv",
          "text": "Under a weaker assumption, that some problem in BQP is hard on average for P/poly, we show that every paddable language outside BPP is sculptable in this way.",
          "type": "quotation"
        }
      ],
      "glosses": [
        "Capable of being padded; said of a set whose strings can be transformed into infinitely many further strings in the set."
      ],
      "id": "en-paddable-en-adj-KE1n8hgh",
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "pad",
          "pad"
        ],
        [
          "set",
          "set"
        ],
        [
          "string",
          "string"
        ]
      ],
      "raw_glosses": [
        "(computing theory) Capable of being padded; said of a set whose strings can be transformed into infinitely many further strings in the set."
      ],
      "tags": [
        "not-comparable"
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "word": "paddable"
}

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "pad",
        "3": "able"
      },
      "expansion": "pad + -able",
      "name": "suffix"
    }
  ],
  "etymology_text": "pad + -able",
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "paddable (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 suffixed with -able",
        "English terms with quotations",
        "English uncomparable adjectives",
        "en:Theory of computing"
      ],
      "examples": [
        {
          "ref": "2015, Scott Aaronson, Shalev Ben-David, “Sculpting Quantum Speedups”, in arXiv",
          "text": "Under a weaker assumption, that some problem in BQP is hard on average for P/poly, we show that every paddable language outside BPP is sculptable in this way.",
          "type": "quotation"
        }
      ],
      "glosses": [
        "Capable of being padded; said of a set whose strings can be transformed into infinitely many further strings in the set."
      ],
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "pad",
          "pad"
        ],
        [
          "set",
          "set"
        ],
        [
          "string",
          "string"
        ]
      ],
      "raw_glosses": [
        "(computing theory) Capable of being padded; said of a set whose strings can be transformed into infinitely many further strings in the set."
      ],
      "tags": [
        "not-comparable"
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "word": "paddable"
}