See probabilistically checkable proof in All languages combined, or Wiktionary
{
"forms": [
{
"form": "probabilistically checkable proofs",
"tags": [
"plural"
]
},
{
"form": "PCP",
"tags": [
"abbreviation"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "probabilistically checkable proof (plural probabilistically checkable proofs)",
"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"
},
{
"kind": "topical",
"langcode": "en",
"name": "Theory of computing",
"orig": "en:Theory of computing",
"parents": [
"Computer science",
"Computing",
"Sciences",
"Technology",
"All topics",
"Fundamental"
],
"source": "w"
}
],
"glosses": [
"A reasonable proof of a computational theorem or conjecture obtained via a randomized algorithm."
],
"id": "en-probabilistically_checkable_proof-en-noun-xSiPzCHc",
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"computational",
"computational"
],
[
"theorem",
"theorem"
],
[
"conjecture",
"conjecture"
],
[
"randomized algorithm",
"randomized algorithm"
]
],
"raw_glosses": [
"(computing theory) A reasonable proof of a computational theorem or conjecture obtained via a randomized algorithm."
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
]
}
],
"word": "probabilistically checkable proof"
}
{
"forms": [
{
"form": "probabilistically checkable proofs",
"tags": [
"plural"
]
},
{
"form": "PCP",
"tags": [
"abbreviation"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "probabilistically checkable proof (plural probabilistically checkable proofs)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"senses": [
{
"categories": [
"English countable nouns",
"English entries with incorrect language header",
"English lemmas",
"English multiword terms",
"English nouns",
"Pages with 1 entry",
"Pages with entries",
"en:Theory of computing"
],
"glosses": [
"A reasonable proof of a computational theorem or conjecture obtained via a randomized algorithm."
],
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"computational",
"computational"
],
[
"theorem",
"theorem"
],
[
"conjecture",
"conjecture"
],
[
"randomized algorithm",
"randomized algorithm"
]
],
"raw_glosses": [
"(computing theory) A reasonable proof of a computational theorem or conjecture obtained via a randomized algorithm."
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
]
}
],
"word": "probabilistically checkable proof"
}
Download raw JSONL data for probabilistically checkable proof meaning in English (1.2kB)
This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2025-01-25 from the enwiktionary dump dated 2025-01-20 using wiktextract (c15a5ce and 5c11237). 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.