"undebuggability" meaning in English

{
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "undebuggability (uncountable)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        }
      ],
      "examples": [
        {
          "ref": "1980 May 12, Jon Doyle, “Introduction”, in A Model for Deliberation, Action, and Introspection (AD-A105 666), Cambridge, Mass.: Massachusetts Institute of Technology, Artificial Intelligence Laboratory, section 6 (Sketch of a Computational Argument for the Approach), subsection 1 (Why have the facts of the fundamental argument been overlooked?), subsubsection 1 (Initial Programming Complexity), page 33:",
          "text": "The simplest answer is the large overhead required by the techniques described here, and the consequential undebuggability of programs based on these techniques. This makes problems admitting more immediately testable solutions more attractive in some ways.",
          "type": "quote"
        },
        {
          "ref": "1983, Herbert A[lexander] Simon, “Why Should Machines Learn?”, in Ryszard S[tanisław] Michalski, Jaime G[uillermo] Carbonell, Tom M[ichael] Mitchell, editors, Machine Learning: An Artificial Intelligence Approach (Symbolic Computation: Artificial Intelligence), Berlin; Heidelberg: Springer-Verlag Berlin Heidelberg, →ISBN, part 1 (General Issues in Machine Learning), section 6 (A Role for Learning), page 34:",
          "text": "Old programs do not learn, they simply fade away. So do human beings, their undebuggable programs replaced by younger, possibly less tangled, ones in other human heads. But at least until the state of undebuggability is reached, human programs are modified adaptively and repeatedly by learning processes that don’t require a knowledge of the internal representation.",
          "type": "quote"
        },
        {
          "ref": "1993, Peter Desain, Henkjan Honing, “Conclusion”, in Array, volume 13, numbers 1–3, page 18, column 3:",
          "text": "We hope to have provoked some response on our criticism but also to have comforted some users in that undebuggability and unreliable results are not only their own fault.",
          "type": "quote"
        }
      ],
      "glosses": [
        "The quality of being undebuggable."
      ],
      "id": "en-undebuggability-en-noun-vtHufLzT",
      "links": [
        [
          "undebuggable",
          "undebuggable"
        ]
      ],
      "tags": [
        "uncountable"
      ]
    }
  ],
  "word": "undebuggability"
}

{
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "undebuggability (uncountable)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English entries with incorrect language header",
        "English lemmas",
        "English nouns",
        "English terms with quotations",
        "English uncountable nouns",
        "Pages with 1 entry",
        "Pages with entries"
      ],
      "examples": [
        {
          "ref": "1980 May 12, Jon Doyle, “Introduction”, in A Model for Deliberation, Action, and Introspection (AD-A105 666), Cambridge, Mass.: Massachusetts Institute of Technology, Artificial Intelligence Laboratory, section 6 (Sketch of a Computational Argument for the Approach), subsection 1 (Why have the facts of the fundamental argument been overlooked?), subsubsection 1 (Initial Programming Complexity), page 33:",
          "text": "The simplest answer is the large overhead required by the techniques described here, and the consequential undebuggability of programs based on these techniques. This makes problems admitting more immediately testable solutions more attractive in some ways.",
          "type": "quote"
        },
        {
          "ref": "1983, Herbert A[lexander] Simon, “Why Should Machines Learn?”, in Ryszard S[tanisław] Michalski, Jaime G[uillermo] Carbonell, Tom M[ichael] Mitchell, editors, Machine Learning: An Artificial Intelligence Approach (Symbolic Computation: Artificial Intelligence), Berlin; Heidelberg: Springer-Verlag Berlin Heidelberg, →ISBN, part 1 (General Issues in Machine Learning), section 6 (A Role for Learning), page 34:",
          "text": "Old programs do not learn, they simply fade away. So do human beings, their undebuggable programs replaced by younger, possibly less tangled, ones in other human heads. But at least until the state of undebuggability is reached, human programs are modified adaptively and repeatedly by learning processes that don’t require a knowledge of the internal representation.",
          "type": "quote"
        },
        {
          "ref": "1993, Peter Desain, Henkjan Honing, “Conclusion”, in Array, volume 13, numbers 1–3, page 18, column 3:",
          "text": "We hope to have provoked some response on our criticism but also to have comforted some users in that undebuggability and unreliable results are not only their own fault.",
          "type": "quote"
        }
      ],
      "glosses": [
        "The quality of being undebuggable."
      ],
      "links": [
        [
          "undebuggable",
          "undebuggable"
        ]
      ],
      "tags": [
        "uncountable"
      ]
    }
  ],
  "word": "undebuggability"
}