"probvious" meaning in English

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "probabilistically",
        "3": "obvious"
      },
      "expansion": "Blend of probabilistically + obvious",
      "name": "blend"
    },
    {
      "args": {
        "1": "en",
        "2": "John Horton Conway",
        "in": "2013",
        "nat": "American",
        "occ": "mathematician"
      },
      "expansion": "Coined by American mathematician John Horton Conway in 2013",
      "name": "coin"
    }
  ],
  "etymology_text": "Blend of probabilistically + obvious. Coined by American mathematician John Horton Conway in 2013.",
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "probvious (not comparable)",
      "name": "en-adj"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "adj",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English blends",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "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"
        },
        {
          "kind": "other",
          "langcode": "en",
          "name": "Theory of computing",
          "orig": "en:Theory of computing",
          "parents": [],
          "source": "w"
        }
      ],
      "examples": [
        {
          "bold_text_offsets": [
            [
              224,
              235
            ]
          ],
          "ref": "2023, Peter Lynch, “Amusical Permutations and Unsettleable Problems”, in ThatsMaths:",
          "text": "For the Collatz conjecture, as written in condensed form, the map is scaling by 1#47;2 or 3#47;2 with equal probability, so the expected growth factor is #92;sqrt#123;3#47;4#125;lt;1}. Thus, we may argue that the map should probviously cycle back to 1. Nevertheless, in a postscript, Conway wrote that the Collatz conjecture is very likely unsettleable.",
          "type": "quotation"
        }
      ],
      "glosses": [
        "Able to be shown to hold with very high confidence via heuristic arguments, but not formally provable."
      ],
      "id": "en-probvious-en-adj-TBvekBwh",
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ]
      ],
      "raw_glosses": [
        "(mathematics, computing theory) Able to be shown to hold with very high confidence via heuristic arguments, but not formally provable."
      ],
      "related": [
        {
          "word": "quasitrivial"
        }
      ],
      "tags": [
        "not-comparable"
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "word": "probvious"
}

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "probabilistically",
        "3": "obvious"
      },
      "expansion": "Blend of probabilistically + obvious",
      "name": "blend"
    },
    {
      "args": {
        "1": "en",
        "2": "John Horton Conway",
        "in": "2013",
        "nat": "American",
        "occ": "mathematician"
      },
      "expansion": "Coined by American mathematician John Horton Conway in 2013",
      "name": "coin"
    }
  ],
  "etymology_text": "Blend of probabilistically + obvious. Coined by American mathematician John Horton Conway in 2013.",
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "probvious (not comparable)",
      "name": "en-adj"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "adj",
  "related": [
    {
      "word": "quasitrivial"
    }
  ],
  "senses": [
    {
      "categories": [
        "English adjectives",
        "English blends",
        "English coinages",
        "English compound terms",
        "English entries with incorrect language header",
        "English lemmas",
        "English terms coined by John Horton Conway",
        "English terms with quotations",
        "English uncomparable adjectives",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Mathematics",
        "en:Theory of computing"
      ],
      "examples": [
        {
          "bold_text_offsets": [
            [
              224,
              235
            ]
          ],
          "ref": "2023, Peter Lynch, “Amusical Permutations and Unsettleable Problems”, in ThatsMaths:",
          "text": "For the Collatz conjecture, as written in condensed form, the map is scaling by 1#47;2 or 3#47;2 with equal probability, so the expected growth factor is #92;sqrt#123;3#47;4#125;lt;1}. Thus, we may argue that the map should probviously cycle back to 1. Nevertheless, in a postscript, Conway wrote that the Collatz conjecture is very likely unsettleable.",
          "type": "quotation"
        }
      ],
      "glosses": [
        "Able to be shown to hold with very high confidence via heuristic arguments, but not formally provable."
      ],
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ]
      ],
      "raw_glosses": [
        "(mathematics, computing theory) Able to be shown to hold with very high confidence via heuristic arguments, but not formally provable."
      ],
      "tags": [
        "not-comparable"
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "word": "probvious"
}