yujunjun/haystack
1
0
Fork 0
mirror of https://github.com/deepset-ai/haystack.git synced 2025-12-30 08:37:20 +00:00
Code Issues Packages Projects Releases Wiki Activity
haystack/test/samples/squad/small.json

10021 lines
374 KiB
JSON
Raw Blame History

This file contains ambiguous Unicode characters

This file contains Unicode characters that might be confused with other characters. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.

{
"version": "v2.0",
"data": [
{
"title": "Normans",
"paragraphs": [
{
"qas": [
{
"question": "In what country is Normandy located?",
"id": "56ddde6b9a695914005b9628",
"answers": [
{
"text": "France",
"answer_start": 159
},
{
"text": "France",
"answer_start": 159
},
{
"text": "France",
"answer_start": 159
},
{
"text": "France",
"answer_start": 159
}
],
"is_impossible": false
},
{
"question": "When were the Normans in Normandy?",
"id": "56ddde6b9a695914005b9629",
"answers": [
{
"text": "10th and 11th centuries",
"answer_start": 94
},
{
"text": "in the 10th and 11th centuries",
"answer_start": 87
},
{
"text": "10th and 11th centuries",
"answer_start": 94
},
{
"text": "10th and 11th centuries",
"answer_start": 94
}
],
"is_impossible": false
},
{
"question": "From which countries did the Norse originate?",
"id": "56ddde6b9a695914005b962a",
"answers": [
{
"text": "Denmark, Iceland and Norway",
"answer_start": 256
},
{
"text": "Denmark, Iceland and Norway",
"answer_start": 256
},
{
"text": "Denmark, Iceland and Norway",
"answer_start": 256
},
{
"text": "Denmark, Iceland and Norway",
"answer_start": 256
}
],
"is_impossible": false
},
{
"question": "Who was the Norse leader?",
"id": "56ddde6b9a695914005b962b",
"answers": [
{
"text": "Rollo",
"answer_start": 308
},
{
"text": "Rollo",
"answer_start": 308
},
{
"text": "Rollo",
"answer_start": 308
},
{
"text": "Rollo",
"answer_start": 308
}
],
"is_impossible": false
},
{
"question": "What century did the Normans first gain their separate identity?",
"id": "56ddde6b9a695914005b962c",
"answers": [
{
"text": "10th century",
"answer_start": 671
},
{
"text": "the first half of the 10th century",
"answer_start": 649
},
{
"text": "10th",
"answer_start": 671
},
{
"text": "10th",
"answer_start": 671
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "Normans",
"answer_start": 4
}
],
"question": "Who gave their name to Normandy in the 1000's and 1100's",
"id": "5ad39d53604f3c001a3fe8d1",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Normandy",
"answer_start": 137
}
],
"question": "What is France a region of?",
"id": "5ad39d53604f3c001a3fe8d2",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Rollo",
"answer_start": 308
}
],
"question": "Who did King Charles III swear fealty to?",
"id": "5ad39d53604f3c001a3fe8d3",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "10th century",
"answer_start": 671
}
],
"question": "When did the Frankish identity emerge?",
"id": "5ad39d53604f3c001a3fe8d4",
"answers": [],
"is_impossible": true
}
],
"context": "The Normans (Norman: Nourmands; French: Normands; Latin: Normanni) were the people who in the 10th and 11th centuries gave their name to Normandy, a region in France. They were descended from Norse (\"Norman\" comes from \"Norseman\") raiders and pirates from Denmark, Iceland and Norway who, under their leader Rollo, agreed to swear fealty to King Charles III of West Francia. Through generations of assimilation and mixing with the native Frankish and Roman-Gaulish populations, their descendants would gradually merge with the Carolingian-based cultures of West Francia. The distinct cultural and ethnic identity of the Normans emerged initially in the first half of the 10th century, and it continued to evolve over the succeeding centuries."
},
{
"qas": [
{
"question": "Who was the duke in the battle of Hastings?",
"id": "56dddf4066d3e219004dad5f",
"answers": [
{
"text": "William the Conqueror",
"answer_start": 1022
},
{
"text": "William the Conqueror",
"answer_start": 1022
},
{
"text": "William the Conqueror",
"answer_start": 1022
}
],
"is_impossible": false
},
{
"question": "Who ruled the duchy of Normandy",
"id": "56dddf4066d3e219004dad60",
"answers": [
{
"text": "Richard I",
"answer_start": 573
},
{
"text": "Richard I",
"answer_start": 573
},
{
"text": "Richard I",
"answer_start": 573
}
],
"is_impossible": false
},
{
"question": "What religion were the Normans",
"id": "56dddf4066d3e219004dad61",
"answers": [
{
"text": "Catholic",
"answer_start": 230
},
{
"text": "Catholic orthodoxy",
"answer_start": 230
},
{
"text": "Catholic",
"answer_start": 230
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "political, cultural and military",
"answer_start": 31
}
],
"question": "What type of major impact did the Norman dynasty have on modern Europe?",
"id": "5ad3a266604f3c001a3fea27",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Normans",
"answer_start": 118
}
],
"question": "Who was famed for their Christian spirit?",
"id": "5ad3a266604f3c001a3fea28",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Normans",
"answer_start": 118
}
],
"question": "Who assimilted the Roman language?",
"id": "5ad3a266604f3c001a3fea29",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Richard I",
"answer_start": 573
}
],
"question": "Who ruled the country of Normandy?",
"id": "5ad3a266604f3c001a3fea2a",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Antioch",
"answer_start": 1295
}
],
"question": "What principality did William the conquerer found?",
"id": "5ad3a266604f3c001a3fea2b",
"answers": [],
"is_impossible": true
}
],
"context": "The Norman dynasty had a major political, cultural and military impact on medieval Europe and even the Near East. The Normans were famed for their martial spirit and eventually for their Christian piety, becoming exponents of the Catholic orthodoxy into which they assimilated. They adopted the Gallo-Romance language of the Frankish land they settled, their dialect becoming known as Norman, Normaund or Norman French, an important literary language. The Duchy of Normandy, which they formed by treaty with the French crown, was a great fief of medieval France, and under Richard I of Normandy was forged into a cohesive and formidable principality in feudal tenure. The Normans are noted both for their culture, such as their unique Romanesque architecture and musical traditions, and for their significant military accomplishments and innovations. Norman adventurers founded the Kingdom of Sicily under Roger II after conquering southern Italy on the Saracens and Byzantines, and an expedition on behalf of their duke, William the Conqueror, led to the Norman conquest of England at the Battle of Hastings in 1066. Norman cultural and military influence spread from these new European centres to the Crusader states of the Near East, where their prince Bohemond I founded the Principality of Antioch in the Levant, to Scotland and Wales in Great Britain, to Ireland, and to the coasts of north Africa and the Canary Islands."
},
{
"qas": [
{
"question": "What is the original meaning of the word Norman?",
"id": "56dde0379a695914005b9636",
"answers": [
{
"text": "Viking",
"answer_start": 341
},
{
"text": "Norseman, Viking",
"answer_start": 331
},
{
"text": "Norseman, Viking",
"answer_start": 331
}
],
"is_impossible": false
},
{
"question": "When was the Latin version of the word Norman first recorded?",
"id": "56dde0379a695914005b9637",
"answers": [
{
"text": "9th century",
"answer_start": 309
},
{
"text": "9th century",
"answer_start": 309
},
{
"text": "9th century",
"answer_start": 309
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "\"Normans\"",
"answer_start": 17
}
],
"question": "What name comes from the English words Normans/Normanz?",
"id": "5ad3ab70604f3c001a3feb89",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "9th century",
"answer_start": 309
}
],
"question": "When was the French version of the word Norman first recorded?",
"id": "5ad3ab70604f3c001a3feb8a",
"answers": [],
"is_impossible": true
}
],
"context": "The English name \"Normans\" comes from the French words Normans/Normanz, plural of Normant, modern French normand, which is itself borrowed from Old Low Franconian Nortmann \"Northman\" or directly from Old Norse Norðmaðr, Latinized variously as Nortmannus, Normannus, or Nordmannus (recorded in Medieval Latin, 9th century) to mean \"Norseman, Viking\"."
},
{
"qas": [
{
"question": "When was the Duchy of Normandy founded?",
"id": "56dde0ba66d3e219004dad75",
"answers": [
{
"text": "911",
"answer_start": 244
},
{
"text": "911",
"answer_start": 244
},
{
"text": "911",
"answer_start": 244
}
],
"is_impossible": false
},
{
"question": "Who did Rollo sign the treaty of Saint-Clair-sur-Epte with?",
"id": "56dde0ba66d3e219004dad76",
"answers": [
{
"text": "King Charles III",
"answer_start": 324
},
{
"text": "King Charles III",
"answer_start": 324
},
{
"text": "King Charles III",
"answer_start": 324
}
],
"is_impossible": false
},
{
"question": "What river originally bounded the Duchy",
"id": "56dde0ba66d3e219004dad77",
"answers": [
{
"text": "Seine",
"answer_start": 711
},
{
"text": "Epte",
"answer_start": 524
},
{
"text": "Seine",
"answer_start": 711
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "10th century",
"answer_start": 21
}
],
"question": "when did Nors encampments ivolve into destructive incursions?",
"id": "5ad3ad61604f3c001a3fec0d",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "treaty of Saint-Clair-sur-Epte",
"answer_start": 285
}
],
"question": "What treaty was established in the 9th century?",
"id": "5ad3ad61604f3c001a3fec0e",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Rollo",
"answer_start": 384
}
],
"question": "Who established a treaty with King Charles the third of France?",
"id": "5ad3ad61604f3c001a3fec0f",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "further Viking incursions.",
"answer_start": 593
}
],
"question": "What did the French promises to protect Rollo and his men from?",
"id": "5ad3ad61604f3c001a3fec10",
"answers": [],
"is_impossible": true
}
],
"context": "In the course of the 10th century, the initially destructive incursions of Norse war bands into the rivers of France evolved into more permanent encampments that included local women and personal property. The Duchy of Normandy, which began in 911 as a fiefdom, was established by the treaty of Saint-Clair-sur-Epte between King Charles III of West Francia and the famed Viking ruler Rollo, and was situated in the former Frankish kingdom of Neustria. The treaty offered Rollo and his men the French lands between the river Epte and the Atlantic coast in exchange for their protection against further Viking incursions. The area corresponded to the northern part of present-day Upper Normandy down to the river Seine, but the Duchy would eventually extend west beyond the Seine. The territory was roughly equivalent to the old province of Rouen, and reproduced the Roman administrative structure of Gallia Lugdunensis II (part of the former Gallia Lugdunensis)."
},
{
"qas": [
{
"question": "Who upon arriving gave the original viking settlers a common identity?",
"id": "56dde1d966d3e219004dad8d",
"answers": [
{
"text": "Rollo",
"answer_start": 7
},
{
"text": "Rollo",
"answer_start": 7
},
{
"text": "Rollo",
"answer_start": 7
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "880s",
"answer_start": 174
}
],
"question": "When did Rollo begin to arrive in Normandy?",
"id": "5ad3ae14604f3c001a3fec39",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Danes, Norwegians, Norse–Gaels, Orkney Vikings, possibly Swedes, and Anglo-Danes",
"answer_start": 547
}
],
"question": "What Viking groups were conquered by Rollo?",
"id": "5ad3ae14604f3c001a3fec3a",
"answers": [],
"is_impossible": true
}
],
"context": "Before Rollo's arrival, its populations did not differ from Picardy or the Île-de-France, which were considered \"Frankish\". Earlier Viking settlers had begun arriving in the 880s, but were divided between colonies in the east (Roumois and Pays de Caux) around the low Seine valley and in the west in the Cotentin Peninsula, and were separated by traditional pagii, where the population remained about the same with almost no foreign settlers. Rollo's contingents who raided and ultimately settled Normandy and parts of the Atlantic coast included Danes, Norwegians, Norse–Gaels, Orkney Vikings, possibly Swedes, and Anglo-Danes from the English Danelaw under Norse control."
},
{
"qas": [
{
"question": "What was the Norman religion?",
"id": "56dde27d9a695914005b9651",
"answers": [
{
"text": "Catholicism",
"answer_start": 121
},
{
"text": "Catholicism",
"answer_start": 121
},
{
"text": "Catholicism",
"answer_start": 121
}
],
"is_impossible": false
},
{
"question": "What part of France were the Normans located?",
"id": "56dde27d9a695914005b9652",
"answers": [
{
"text": "north",
"answer_start": 327
},
{
"text": "the north",
"answer_start": 323
},
{
"text": "north",
"answer_start": 327
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "Catholicism",
"answer_start": 121
}
],
"question": "What was replace with the Norse religion?",
"id": "5ad3af11604f3c001a3fec63",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Frankish heritage",
"answer_start": 224
}
],
"question": "What did maternal Old Norse traditions merge with?",
"id": "5ad3af11604f3c001a3fec64",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Old Norse",
"answer_start": 97
}
],
"question": "What language replaced the Gallo-Romance language?",
"id": "5ad3af11604f3c001a3fec65",
"answers": [],
"is_impossible": true
}
],
"context": "The descendants of Rollo's Vikings and their Frankish wives would replace the Norse religion and Old Norse language with Catholicism (Christianity) and the Gallo-Romance language of the local people, blending their maternal Frankish heritage with Old Norse traditions and customs to synthesize a unique \"Norman\" culture in the north of France. The Norman language was forged by the adoption of the indigenous langue d'oïl branch of Romance by a Norse-speaking ruling class, and it developed into the regional language that survives today."
},
{
"qas": [
{
"question": "What was one of the Norman's major exports?",
"id": "56dde2fa66d3e219004dad9b",
"answers": [
{
"text": "fighting horsemen",
"answer_start": 428
},
{
"text": "fighting horsemen",
"answer_start": 428
},
{
"text": "fighting horsemen",
"answer_start": 428
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "France",
"answer_start": 75
}
],
"question": "Who adopted the fuedel doctrines of the Normans?",
"id": "5ad3c626604f3c001a3ff011",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "fighting horsemen",
"answer_start": 428
}
],
"question": "What was one of the Norman's major imports?",
"id": "5ad3c626604f3c001a3ff012",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Italy, France and England",
"answer_start": 490
}
],
"question": "Who's arristocracy eventually served as avid Crusaders?",
"id": "5ad3c626604f3c001a3ff013",
"answers": [],
"is_impossible": true
}
],
"context": "The Normans thereafter adopted the growing feudal doctrines of the rest of France, and worked them into a functional hierarchical system in both Normandy and in England. The new Norman rulers were culturally and ethnically distinct from the old French aristocracy, most of whom traced their lineage to Franks of the Carolingian dynasty. Most Norman knights remained poor and land-hungry, and by 1066 Normandy had been exporting fighting horsemen for more than a generation. Many Normans of Italy, France and England eventually served as avid Crusaders under the Italo-Norman prince Bohemund I and the Anglo-Norman king Richard the Lion-Heart."
},
{
"qas": [
{
"question": "Who was the Normans' main enemy in Italy, the Byzantine Empire and Armenia?",
"id": "56de0f6a4396321400ee257f",
"answers": [
{
"text": "Seljuk Turks",
"answer_start": 161
},
{
"text": "the Pechenegs, the Bulgars, and especially the Seljuk Turks",
"answer_start": 114
},
{
"text": "the Seljuk Turks",
"answer_start": 157
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "Normans",
"answer_start": 15
}
],
"question": "Who entered Italy soon after the Byzantine Empire?",
"id": "5ad3dbc6604f3c001a3ff3e9",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Pechenegs, the Bulgars, and especially the Seljuk Turks",
"answer_start": 118
}
],
"question": "Who did the Normans fight in Italy?",
"id": "5ad3dbc6604f3c001a3ff3ea",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Lombards",
"answer_start": 244
}
],
"question": "Who did the Normans encourage to come to the south?",
"id": "5ad3dbc6604f3c001a3ff3eb",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "the Sicilian campaign of George Maniaces",
"answer_start": 404
}
],
"question": "During what campaign did the Vargian and Lombard fight?",
"id": "5ad3dbc6604f3c001a3ff3ec",
"answers": [],
"is_impossible": true
}
],
"context": "Soon after the Normans began to enter Italy, they entered the Byzantine Empire and then Armenia, fighting against the Pechenegs, the Bulgars, and especially the Seljuk Turks. Norman mercenaries were first encouraged to come to the south by the Lombards to act against the Byzantines, but they soon fought in Byzantine service in Sicily. They were prominent alongside Varangian and Lombard contingents in the Sicilian campaign of George Maniaces in 1038–40. There is debate whether the Normans in Greek service actually were from Norman Italy, and it now seems likely only a few came from there. It is also unknown how many of the \"Franks\", as the Byzantines called them, were Normans and not other Frenchmen."
},
{
"qas": [
{
"question": "When did Herve serve as a Byzantine general?",
"id": "56de0ffd4396321400ee258d",
"answers": [
{
"text": "1050s",
"answer_start": 85
},
{
"text": "in the 1050s",
"answer_start": 78
},
{
"text": "in the 1050s",
"answer_start": 78
}
],
"is_impossible": false
},
{
"question": "When did Robert Crispin go up against the Turks?",
"id": "56de0ffd4396321400ee258e",
"answers": [
{
"text": "1060s",
"answer_start": 292
},
{
"text": "In the 1060s",
"answer_start": 285
},
{
"text": "In the 1060s",
"answer_start": 285
}
],
"is_impossible": false
},
{
"question": "Who ruined Roussel de Bailleul's plans for an independent state?",
"id": "56de0ffd4396321400ee258f",
"answers": [
{
"text": "Alexius Komnenos",
"answer_start": 522
},
{
"text": "Alexius Komnenos",
"answer_start": 522
},
{
"text": "Alexius Komnenos",
"answer_start": 522
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "Hervé",
"answer_start": 72
}
],
"question": "Who was the first Byzantine mercenary to serve with the Normans?",
"id": "5ad3de8b604f3c001a3ff467",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "1050s",
"answer_start": 85
}
],
"question": "When did Herve serve as a Norman general?",
"id": "5ad3de8b604f3c001a3ff468",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Roussel de Bailleul",
"answer_start": 359
}
],
"question": "Who ruined Alexius Komnenos plans for an independent state?",
"id": "5ad3de8b604f3c001a3ff469",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "1060s",
"answer_start": 292
}
],
"question": "When did Herve go up against the Turks?",
"id": "5ad3de8b604f3c001a3ff46a",
"answers": [],
"is_impossible": true
}
],
"context": "One of the first Norman mercenaries to serve as a Byzantine general was Hervé in the 1050s. By then however, there were already Norman mercenaries serving as far away as Trebizond and Georgia. They were based at Malatya and Edessa, under the Byzantine duke of Antioch, Isaac Komnenos. In the 1060s, Robert Crispin led the Normans of Edessa against the Turks. Roussel de Bailleul even tried to carve out an independent state in Asia Minor with support from the local population, but he was stopped by the Byzantine general Alexius Komnenos."
},
{
"qas": [
{
"question": "What was the name of the Norman castle?",
"id": "56de10b44396321400ee2593",
"answers": [
{
"text": "Afranji",
"answer_start": 539
},
{
"text": "Afranji",
"answer_start": 539
},
{
"text": "Afranji",
"answer_start": 539
}
],
"is_impossible": false
},
{
"question": "Who was the leader when the Franks entered the Euphrates valley?",
"id": "56de10b44396321400ee2594",
"answers": [
{
"text": "Oursel",
"answer_start": 256
},
{
"text": "Oursel",
"answer_start": 256
},
{
"text": "Oursel",
"answer_start": 256
}
],
"is_impossible": false
},
{
"question": "Who did the Normans team up with in Anatolia?",
"id": "56de10b44396321400ee2595",
"answers": [
{
"text": "Turkish forces",
"answer_start": 20
},
{
"text": "Turkish forces",
"answer_start": 20
},
{
"text": "Turkish forces",
"answer_start": 20
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "Turkish",
"answer_start": 20
}
],
"question": "Who joined Norman forces in the destruction of the Armenians?",
"id": "5ad3e96b604f3c001a3ff689",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "the Armenian state",
"answer_start": 171
}
],
"question": "Who did the Turks take up service with?",
"id": "5ad3e96b604f3c001a3ff68a",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Oursel",
"answer_start": 256
}
],
"question": "What Frank led Norman forces?",
"id": "5ad3e96b604f3c001a3ff68b",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "the upper Euphrates valley in northern Syria",
"answer_start": 292
}
],
"question": "Where did Oursel lead the Franks?",
"id": "5ad3e96b604f3c001a3ff68c",
"answers": [],
"is_impossible": true
}
],
"context": "Some Normans joined Turkish forces to aid in the destruction of the Armenians vassal-states of Sassoun and Taron in far eastern Anatolia. Later, many took up service with the Armenian state further south in Cilicia and the Taurus Mountains. A Norman named Oursel led a force of \"Franks\" into the upper Euphrates valley in northern Syria. From 1073 to 1074, 8,000 of the 20,000 troops of the Armenian general Philaretus Brachamius were Normans—formerly of Oursel—led by Raimbaud. They even lent their ethnicity to the name of their castle: Afranji, meaning \"Franks.\" The known trade between Amalfi and Antioch and between Bari and Tarsus may be related to the presence of Italo-Normans in those cities while Amalfi and Bari were under Norman rule in Italy."
},
{
"qas": [
{
"question": "What were the origins of the Raouliii family?",
"id": "56de11154396321400ee25aa",
"answers": [
{
"text": "Norman mercenary",
"answer_start": 45
},
{
"text": "an Italo-Norman named Raoul",
"answer_start": 217
},
{
"text": "descended from an Italo-Norman named Raoul",
"answer_start": 202
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "Byzantine Greece",
"answer_start": 20
}
],
"question": "Where were several Norman mercenary familes originate from?",
"id": "5ad3ea79604f3c001a3ff6e9",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "George Maniaces",
"answer_start": 402
}
],
"question": "Who did the Normans serve under in the 10th century?",
"id": "5ad3ea79604f3c001a3ff6ea",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Sicilian expedition",
"answer_start": 425
}
],
"question": "What expedition did George Maniaces lead in the 10th century?",
"id": "5ad3ea79604f3c001a3ff6eb",
"answers": [],
"is_impossible": true
}
],
"context": "Several families of Byzantine Greece were of Norman mercenary origin during the period of the Comnenian Restoration, when Byzantine emperors were seeking out western European warriors. The Raoulii were descended from an Italo-Norman named Raoul, the Petraliphae were descended from a Pierre d'Aulps, and that group of Albanian clans known as the Maniakates were descended from Normans who served under George Maniaces in the Sicilian expedition of 1038."
},
{
"qas": [
{
"question": "What was the name of the count of Apulia ",
"id": "56de148dcffd8e1900b4b5bc",
"answers": [
{
"text": "Robert Guiscard",
"answer_start": 0
},
{
"text": "Robert Guiscard",
"answer_start": 0
},
{
"text": "Robert Guiscard",
"answer_start": 0
}
],
"is_impossible": false
},
{
"question": "When did Dyrrachium fall to the Normans?",
"id": "56de148dcffd8e1900b4b5bd",
"answers": [
{
"text": "1082",
"answer_start": 1315
},
{
"text": "February 1082",
"answer_start": 1306
},
{
"text": "February 1082",
"answer_start": 1306
}
],
"is_impossible": false
},
{
"question": "How many men were in Robert's army?",
"id": "56de148dcffd8e1900b4b5be",
"answers": [
{
"text": "30,000",
"answer_start": 492
},
{
"text": "30,000",
"answer_start": 492
},
{
"text": "30,000",
"answer_start": 492
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "Robert Guiscard",
"answer_start": 0
}
],
"question": "Who ultimatly drove the Byzantines out of Europe?",
"id": "5ad3ed26604f3c001a3ff799",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "pope Gregory VII",
"answer_start": 225
}
],
"question": "What pope opposed Roberts campaign?",
"id": "5ad3ed26604f3c001a3ff79a",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Dyrrachium",
"answer_start": 1326
}
],
"question": "What fell to the Normans in the 10th century?",
"id": "5ad3ed26604f3c001a3ff79b",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "30,000",
"answer_start": 492
}
],
"question": "How many men did Roberts army face?",
"id": "5ad3ed26604f3c001a3ff79c",
"answers": [],
"is_impossible": true
}
],
"context": "Robert Guiscard, an other Norman adventurer previously elevated to the dignity of count of Apulia as the result of his military successes, ultimately drove the Byzantines out of southern Italy. Having obtained the consent of pope Gregory VII and acting as his vassal, Robert continued his campaign conquering the Balkan peninsula as a foothold for western feudal lords and the Catholic Church. After allying himself with Croatia and the Catholic cities of Dalmatia, in 1081 he led an army of 30,000 men in 300 ships landing on the southern shores of Albania, capturing Valona, Kanina, Jericho (Orikumi), and reaching Butrint after numerous pillages. They joined the fleet that had previously conquered Corfu and attacked Dyrrachium from land and sea, devastating everything along the way. Under these harsh circumstances, the locals accepted the call of emperor Alexius I Comnenus to join forces with the Byzantines against the Normans. The Albanian forces could not take part in the ensuing battle because it had started before their arrival. Immediately before the battle, the Venetian fleet had secured a victory in the coast surrounding the city. Forced to retreat, Alexius ceded the command to a high Albanian official named Comiscortes in the service of Byzantium. The city's garrison resisted until February 1082, when Dyrrachium was betrayed to the Normans by the Venetian and Amalfitan merchants who had settled there. The Normans were now free to penetrate into the hinterland; they took Ioannina and some minor cities in southwestern Macedonia and Thessaly before appearing at the gates of Thessalonica. Dissension among the high ranks coerced the Normans to retreat to Italy. They lost Dyrrachium, Valona, and Butrint in 1085, after the death of Robert."
},
{
"qas": [
{
"question": "Where did the Normans and Byzantines sign the peace treaty?",
"id": "56de15104396321400ee25b7",
"answers": [
{
"text": "Deabolis",
"answer_start": 302
},
{
"text": "Deabolis",
"answer_start": 718
},
{
"text": "Deabolis",
"answer_start": 718
}
],
"is_impossible": false
},
{
"question": "Who was Robert's son?",
"id": "56de15104396321400ee25b8",
"answers": [
{
"text": "Bohemond",
"answer_start": 79
},
{
"text": "Bohemond",
"answer_start": 79
},
{
"text": "Bohemond",
"answer_start": 79
}
],
"is_impossible": false
},
{
"question": "What river was Petrela located by?",
"id": "56de15104396321400ee25b9",
"answers": [
{
"text": "Deabolis",
"answer_start": 302
},
{
"text": "the river Deabolis",
"answer_start": 292
},
{
"text": "Deabolis",
"answer_start": 302
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "Dyrrachium",
"answer_start": 133
}
],
"question": "Who did the Normans besiege in the 11th century?",
"id": "5ad3ee2d604f3c001a3ff7e1",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Normans",
"answer_start": 50
}
],
"question": "Who did Robert lead agains Dyrrachium in 1107?",
"id": "5ad3ee2d604f3c001a3ff7e2",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Robert",
"answer_start": 89
}
],
"question": "Who was Bohemond's son?",
"id": "5ad3ee2d604f3c001a3ff7e3",
"answers": [],
"is_impossible": true
}
],
"context": "A few years after the First Crusade, in 1107, the Normans under the command of Bohemond, Robert's son, landed in Valona and besieged Dyrrachium using the most sophisticated military equipment of the time, but to no avail. Meanwhile, they occupied Petrela, the citadel of Mili at the banks of the river Deabolis, Gllavenica (Ballsh), Kanina and Jericho. This time, the Albanians sided with the Normans, dissatisfied by the heavy taxes the Byzantines had imposed upon them. With their help, the Normans secured the Arbanon passes and opened their way to Dibra. The lack of supplies, disease and Byzantine resistance forced Bohemond to retreat from his campaign and sign a peace treaty with the Byzantines in the city of Deabolis."
},
{
"qas": [
{
"question": "When did the Normans attack Dyrrachium?",
"id": "56de1563cffd8e1900b4b5c2",
"answers": [
{
"text": "1185",
"answer_start": 86
},
{
"text": "in 1185",
"answer_start": 83
},
{
"text": "1185",
"answer_start": 86
}
],
"is_impossible": false
},
{
"question": "What was the naval base called?",
"id": "56de1563cffd8e1900b4b5c3",
"answers": [
{
"text": "Dyrrachium",
"answer_start": 125
},
{
"text": "Dyrrachium",
"answer_start": 205
},
{
"text": "Dyrrachium",
"answer_start": 205
}
],
"is_impossible": false
},
{
"question": "Where was Dyrrachium located?",
"id": "56de1563cffd8e1900b4b5c4",
"answers": [
{
"text": "the Adriatic",
"answer_start": 257
},
{
"text": "the Adriatic",
"answer_start": 257
},
{
"text": "Adriatic",
"answer_start": 261
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "Norman army",
"answer_start": 105
}
],
"question": "Who attacked Dyrrachium in the 11th century?",
"id": "5ad3f028604f3c001a3ff823",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "high Byzantine officials",
"answer_start": 162
}
],
"question": "Who betrayed the Normans?",
"id": "5ad3f028604f3c001a3ff824",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Dyrrachium",
"answer_start": 205
}
],
"question": "What naval base fell to the Normans?",
"id": "5ad3f028604f3c001a3ff825",
"answers": [],
"is_impossible": true
}
],
"context": "The further decline of Byzantine state-of-affairs paved the road to a third attack in 1185, when a large Norman army invaded Dyrrachium, owing to the betrayal of high Byzantine officials. Some time later, Dyrrachium—one of the most important naval bases of the Adriatic—fell again to Byzantine hands."
},
{
"qas": [
{
"question": "Who did Emma Marry?",
"id": "56de15dbcffd8e1900b4b5c8",
"answers": [
{
"text": "King Ethelred II",
"answer_start": 360
},
{
"text": "Ethelred II",
"answer_start": 365
},
{
"text": "King Ethelred II",
"answer_start": 360
}
],
"is_impossible": false
},
{
"question": "Who was Emma's brother?",
"id": "56de15dbcffd8e1900b4b5c9",
"answers": [
{
"text": "Duke Richard II",
"answer_start": 327
},
{
"text": "Duke Richard II",
"answer_start": 327
},
{
"text": "Duke Richard II",
"answer_start": 327
}
],
"is_impossible": false
},
{
"question": "To where did Ethelred flee?",
"id": "56de15dbcffd8e1900b4b5ca",
"answers": [
{
"text": "Normandy",
"answer_start": 423
},
{
"text": "Normandy",
"answer_start": 423
},
{
"text": "Normandy",
"answer_start": 423
}
],
"is_impossible": false
},
{
"question": "Who kicked Ethelred out?",
"id": "56de15dbcffd8e1900b4b5cb",
"answers": [
{
"text": "Sweyn Forkbeard",
"answer_start": 480
},
{
"text": "Sweyn Forkbeard",
"answer_start": 480
},
{
"text": "Sweyn Forkbeard",
"answer_start": 480
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "Emma",
"answer_start": 562
}
],
"question": "Who married Cnut the Great?",
"id": "5ad3f187604f3c001a3ff86f",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "1013",
"answer_start": 435
}
],
"question": "When did Richard II flee to Normandy?",
"id": "5ad3f187604f3c001a3ff870",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Viking",
"answer_start": 90
}
],
"question": "Who's major ports were controlled by the English?",
"id": "5ad3f187604f3c001a3ff871",
"answers": [],
"is_impossible": true
}
],
"context": "The Normans were in contact with England from an early date. Not only were their original Viking brethren still ravaging the English coasts, they occupied most of the important ports opposite England across the English Channel. This relationship eventually produced closer ties of blood through the marriage of Emma, sister of Duke Richard II of Normandy, and King Ethelred II of England. Because of this, Ethelred fled to Normandy in 1013, when he was forced from his kingdom by Sweyn Forkbeard. His stay in Normandy (until 1016) influenced him and his sons by Emma, who stayed in Normandy after Cnut the Great's conquest of the isle."
},
{
"qas": [
{
"question": "Who was Edward the Confessor's half-brother?",
"id": "56de1645cffd8e1900b4b5d0",
"answers": [
{
"text": "Harthacnut",
"answer_start": 115
},
{
"text": "Harthacnut",
"answer_start": 115
},
{
"text": "Harthacnut",
"answer_start": 115
}
],
"is_impossible": false
},
{
"question": "When did Edward return?",
"id": "56de1645cffd8e1900b4b5d1",
"answers": [
{
"text": "1041",
"answer_start": 71
},
{
"text": "in 1041",
"answer_start": 68
},
{
"text": "1041",
"answer_start": 71
}
],
"is_impossible": false
},
{
"question": "Who did Edward make archbishop of Canterbury?",
"id": "56de1645cffd8e1900b4b5d2",
"answers": [
{
"text": "Robert of Jumièges",
"answer_start": 382
},
{
"text": "Robert of Jumièges",
"answer_start": 382
},
{
"text": "Robert of Jumièges",
"answer_start": 382
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "1041",
"answer_start": 71
}
],
"question": "When did Edward the Confessor's son return from his fathers refuge?",
"id": "5ad3f350604f3c001a3ff8ef",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "English cavalry force",
"answer_start": 253
}
],
"question": "What kind of force did Harthacnut establish?",
"id": "5ad3f350604f3c001a3ff8f0",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Edward",
"answer_start": 361
}
],
"question": "Who made Robert of Jumieges earl of Hereford?",
"id": "5ad3f350604f3c001a3ff8f1",
"answers": [],
"is_impossible": true
}
],
"context": "When finally Edward the Confessor returned from his father's refuge in 1041, at the invitation of his half-brother Harthacnut, he brought with him a Norman-educated mind. He also brought many Norman counsellors and fighters, some of whom established an English cavalry force. This concept never really took root, but it is a typical example of the attitudes of Edward. He appointed Robert of Jumièges archbishop of Canterbury and made Ralph the Timid earl of Hereford. He invited his brother-in-law Eustace II, Count of Boulogne to his court in 1051, an event which resulted in the greatest of early conflicts between Saxon and Norman and ultimately resulted in the exile of Earl Godwin of Wessex."
},
{
"qas": [
{
"question": "Where did Harold II die?",
"id": "56de16ca4396321400ee25c5",
"answers": [
{
"text": "Battle of Hastings",
"answer_start": 85
},
{
"text": "the Battle of Hastings",
"answer_start": 81
},
{
"text": "at the Battle of Hastings",
"answer_start": 78
}
],
"is_impossible": false
},
{
"question": "Who killed Harold II? ",
"id": "56de16ca4396321400ee25c6",
"answers": [
{
"text": "William II",
"answer_start": 14
},
{
"text": "Duke William II",
"answer_start": 9
},
{
"text": "Duke William II",
"answer_start": 9
}
],
"is_impossible": false
},
{
"question": "When was the Battle of Hastings?",
"id": "56de16ca4396321400ee25c7",
"answers": [
{
"text": "1066",
"answer_start": 3
},
{
"text": "In 1066",
"answer_start": 0
},
{
"text": "1066",
"answer_start": 3
}
],
"is_impossible": false
},
{
"question": "Who was the ruling class ahead of the Normans?",
"id": "56de16ca4396321400ee25c8",
"answers": [
{
"text": "Anglo-Saxons",
"answer_start": 161
},
{
"text": "the Anglo-Saxons",
"answer_start": 157
},
{
"text": "Anglo-Saxons",
"answer_start": 161
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "1066,",
"answer_start": 3
}
],
"question": "When did King Harold II conquer England?",
"id": "5ad3f4b1604f3c001a3ff951",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Battle of Hastings",
"answer_start": 85
}
],
"question": "What battle took place in the 10th century?",
"id": "5ad3f4b1604f3c001a3ff952",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Anglo-Saxons",
"answer_start": 161
}
],
"question": "Who replaced the Normans as the ruling class?",
"id": "5ad3f4b1604f3c001a3ff953",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Early Norman kings",
"answer_start": 317
}
],
"question": "Who considered their land on the continent their most important holding?",
"id": "5ad3f4b1604f3c001a3ff954",
"answers": [],
"is_impossible": true
}
],
"context": "In 1066, Duke William II of Normandy conquered England killing King Harold II at the Battle of Hastings. The invading Normans and their descendants replaced the Anglo-Saxons as the ruling class of England. The nobility of England were part of a single Normans culture and many had lands on both sides of the channel. Early Norman kings of England, as Dukes of Normandy, owed homage to the King of France for their land on the continent. They considered England to be their most important holding (it brought with it the title of King—an important status symbol)."
},
{
"qas": [
{
"question": "What was the Anglo-Norman language's final form?",
"id": "56de1728cffd8e1900b4b5d7",
"answers": [
{
"text": "Modern English",
"answer_start": 629
},
{
"text": "Modern English",
"answer_start": 629
},
{
"text": "Modern English",
"answer_start": 629
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "Norman aristocracy",
"answer_start": 130
}
],
"question": "Who identified themselves as French during the Hundred Years War?",
"id": "5ad3f5b0604f3c001a3ff9ab",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Anglo-Saxon",
"answer_start": 382
}
],
"question": "What was absorbed into the Anglo-Norman language?",
"id": "5ad3f5b0604f3c001a3ff9ac",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Geoffrey Chaucer",
"answer_start": 305
}
],
"question": "Who made fun of the Latin language?",
"id": "5ad3f5b0604f3c001a3ff9ad",
"answers": [],
"is_impossible": true
}
],
"context": "Eventually, the Normans merged with the natives, combining languages and traditions. In the course of the Hundred Years' War, the Norman aristocracy often identified themselves as English. The Anglo-Norman language became distinct from the Latin language, something that was the subject of some humour by Geoffrey Chaucer. The Anglo-Norman language was eventually absorbed into the Anglo-Saxon language of their subjects (see Old English) and influenced it, helping (along with the Norse language of the earlier Anglo-Norse settlers and the Latin used by the church) in the development of Middle English. It in turn evolved into Modern English."
},
{
"qas": [
{
"question": "In what year did the Norman's invade at Bannow Bay?",
"id": "56de179dcffd8e1900b4b5da",
"answers": [
{
"text": "1169",
"answer_start": 101
},
{
"text": "1169",
"answer_start": 101
},
{
"text": "1169",
"answer_start": 101
}
],
"is_impossible": false
},
{
"question": "What country did the Normans invade in 1169?",
"id": "56de179dcffd8e1900b4b5db",
"answers": [
{
"text": "Ireland",
"answer_start": 379
},
{
"text": "Ireland",
"answer_start": 379
},
{
"text": "Ireland",
"answer_start": 379
}
],
"is_impossible": false
},
{
"question": "What culture did the Normans combine with in Ireland?",
"id": "56de179dcffd8e1900b4b5dc",
"answers": [
{
"text": "Irish",
"answer_start": 37
},
{
"text": "Irish",
"answer_start": 220
},
{
"text": "Irish",
"answer_start": 220
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "Bannow Bay",
"answer_start": 87
}
],
"question": "Where did the Normans invade in the 11th century?",
"id": "5ad3f6f5604f3c001a3ffa09",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "The Normans",
"answer_start": 0
}
],
"question": "Who did the Irish culture have a profound effect on?",
"id": "5ad3f6f5604f3c001a3ffa0a",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Trim Castle and Dublin Castle",
"answer_start": 473
}
],
"question": "What castles were built by the Irish?",
"id": "5ad3f6f5604f3c001a3ffa0b",
"answers": [],
"is_impossible": true
}
],
"context": "The Normans had a profound effect on Irish culture and history after their invasion at Bannow Bay in 1169. Initially the Normans maintained a distinct culture and ethnicity. Yet, with time, they came to be subsumed into Irish culture to the point that it has been said that they became \"more Irish than the Irish themselves.\" The Normans settled mostly in an area in the east of Ireland, later known as the Pale, and also built many fine castles and settlements, including Trim Castle and Dublin Castle. Both cultures intermixed, borrowing from each other's language, culture and outlook. Norman descendants today can be recognised by their surnames. Names such as French, (De) Roche, Devereux, D'Arcy, Treacy and Lacy are particularly common in the southeast of Ireland, especially in the southern part of County Wexford where the first Norman settlements were established. Other Norman names such as Furlong predominate there. Another common Norman-Irish name was Morell (Murrell) derived from the French Norman name Morel. Other names beginning with Fitz (from the Norman for son) indicate Norman ancestry. These included Fitzgerald, FitzGibbons (Gibbons) dynasty, Fitzmaurice. Other families bearing such surnames as Barry (de Barra) and De Búrca (Burke) are also of Norman extraction."
},
{
"qas": [
{
"question": "Who was Margaret's brother?",
"id": "56de17f9cffd8e1900b4b5e0",
"answers": [
{
"text": "Edgar",
"answer_start": 75
},
{
"text": "Edgar",
"answer_start": 157
},
{
"text": "Edgar Atheling",
"answer_start": 75
}
],
"is_impossible": false
},
{
"question": "Who was Margaret's husband?",
"id": "56de17f9cffd8e1900b4b5e1",
"answers": [
{
"text": "King Malcolm III of Scotland",
"answer_start": 120
},
{
"text": "King Malcolm III",
"answer_start": 120
},
{
"text": "King Malcolm III",
"answer_start": 120
}
],
"is_impossible": false
},
{
"question": "When was Scotland invaded by William?",
"id": "56de17f9cffd8e1900b4b5e2",
"answers": [
{
"text": "1072",
"answer_start": 300
},
{
"text": "1072",
"answer_start": 300
},
{
"text": "1072",
"answer_start": 300
}
],
"is_impossible": false
},
{
"question": "Who was the hostage?",
"id": "56de17f9cffd8e1900b4b5e3",
"answers": [
{
"text": "Duncan",
"answer_start": 440
},
{
"text": "Duncan",
"answer_start": 440
},
{
"text": "Duncan",
"answer_start": 440
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "Margaret",
"answer_start": 172
}
],
"question": "Who did Edgar marry?",
"id": "5ad3f7ac604f3c001a3ffa3b",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "William",
"answer_start": 272
}
],
"question": "Who invaded Scotland in the 10th century?",
"id": "5ad3f7ac604f3c001a3ffa3c",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Duncan",
"answer_start": 440
}
],
"question": "Who did the Scotish king take hostage?",
"id": "5ad3f7ac604f3c001a3ffa3d",
"answers": [],
"is_impossible": true
}
],
"context": "One of the claimants of the English throne opposing William the Conqueror, Edgar Atheling, eventually fled to Scotland. King Malcolm III of Scotland married Edgar's sister Margaret, and came into opposition to William who had already disputed Scotland's southern borders. William invaded Scotland in 1072, riding as far as Abernethy where he met up with his fleet of ships. Malcolm submitted, paid homage to William and surrendered his son Duncan as a hostage, beginning a series of arguments as to whether the Scottish Crown owed allegiance to the King of England."
},
{
"qas": [
{
"question": "Who did Alexander I marry?",
"id": "56de3cd0cffd8e1900b4b6be",
"answers": [
{
"text": "Sybilla of Normandy",
"answer_start": 271
},
{
"text": "Sybilla of Normandy",
"answer_start": 271
},
{
"text": "Sybilla",
"answer_start": 271
}
],
"is_impossible": false
},
{
"question": "What culture's arrival in Scotland is know as the \"Davidian Revolution\"?",
"id": "56de3cd0cffd8e1900b4b6bf",
"answers": [
{
"text": "Norman",
"answer_start": 336
},
{
"text": "Norman",
"answer_start": 336
},
{
"text": "Norman",
"answer_start": 336
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "Sybilla of Normandy",
"answer_start": 271
}
],
"question": "Who did King David I of Scotland Marry?",
"id": "5ad3f8d2604f3c001a3ffa8d",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Normans and Norman culture",
"answer_start": 324
}
],
"question": "What did Sybilla of Normandy introduce to Scotland?",
"id": "5ad3f8d2604f3c001a3ffa8e",
"answers": [],
"is_impossible": true
}
],
"context": "Normans came into Scotland, building castles and founding noble families who would provide some future kings, such as Robert the Bruce, as well as founding a considerable number of the Scottish clans. King David I of Scotland, whose elder brother Alexander I had married Sybilla of Normandy, was instrumental in introducing Normans and Norman culture to Scotland, part of the process some scholars call the \"Davidian Revolution\". Having spent time at the court of Henry I of England (married to David's sister Maud of Scotland), and needing them to wrestle the kingdom from his half-brother Máel Coluim mac Alaxandair, David had to reward many with lands. The process was continued under David's successors, most intensely of all under William the Lion. The Norman-derived feudal system was applied in varying degrees to most of Scotland. Scottish families of the names Bruce, Gray, Ramsay, Fraser, Ogilvie, Montgomery, Sinclair, Pollock, Burnard, Douglas and Gordon to name but a few, and including the later royal House of Stewart, can all be traced back to Norman ancestry."
},
{
"qas": [
{
"question": "Where was Ralph earl of?",
"id": "56de3d594396321400ee26ca",
"answers": [
{
"text": "Hereford",
"answer_start": 158
},
{
"text": "Hereford",
"answer_start": 158
},
{
"text": "Hereford",
"answer_start": 158
}
],
"is_impossible": false
},
{
"question": "Who was Ralph in charge of being at war with?",
"id": "56de3d594396321400ee26cb",
"answers": [
{
"text": "the Welsh",
"answer_start": 227
},
{
"text": "the Welsh",
"answer_start": 227
},
{
"text": "the Welsh",
"answer_start": 227
}
],
"is_impossible": false
},
{
"question": "Who made Ralph earl?",
"id": "56de3d594396321400ee26cc",
"answers": [
{
"text": "Edward the Confessor",
"answer_start": 90
},
{
"text": "Edward the Confessor",
"answer_start": 90
},
{
"text": "Edward the Confessor",
"answer_start": 90
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "Normans",
"answer_start": 48
}
],
"question": "Who came into contact with Wales after the conquest of England?",
"id": "5ad3fb01604f3c001a3ffb35",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Ralph",
"answer_start": 141
}
],
"question": "Who made Edward the Confessor Earl?",
"id": "5ad3fb01604f3c001a3ffb36",
"answers": [],
"is_impossible": true
}
],
"context": "Even before the Norman Conquest of England, the Normans had come into contact with Wales. Edward the Confessor had set up the aforementioned Ralph as earl of Hereford and charged him with defending the Marches and warring with the Welsh. In these original ventures, the Normans failed to make any headway into Wales."
},
{
"qas": [
{
"question": "What country was under the control of Norman barons?",
"id": "56de3dbacffd8e1900b4b6d2",
"answers": [
{
"text": "Wales",
"answer_start": 299
},
{
"text": "Wales",
"answer_start": 299
},
{
"text": "Wales",
"answer_start": 299
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "the Marches",
"answer_start": 37
}
],
"question": "What came under Williams dominace before the conquest?",
"id": "5ad3fb6e604f3c001a3ffb5f",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Bernard de Neufmarché, Roger of Montgomery in Shropshire and Hugh Lupus in Cheshire",
"answer_start": 136
}
],
"question": "What Welsh lords did William conquer?",
"id": "5ad3fb6e604f3c001a3ffb60",
"answers": [],
"is_impossible": true
}
],
"context": "Subsequent to the Conquest, however, the Marches came completely under the dominance of William's most trusted Norman barons, including Bernard de Neufmarché, Roger of Montgomery in Shropshire and Hugh Lupus in Cheshire. These Normans began a long period of slow conquest during which almost all of Wales was at some point subject to Norman interference. Norman words, such as baron (barwn), first entered Welsh at that time."
},
{
"qas": [
{
"question": "What year did Roger de Tosny fail to accomplish what he set out to do?",
"id": "56de3e414396321400ee26d8",
"answers": [
{
"text": "1018",
"answer_start": 221
},
{
"text": "1064",
"answer_start": 345
},
{
"text": "1018",
"answer_start": 221
}
],
"is_impossible": false
},
{
"question": "Who was in charge of the papal army in the War of Barbastro?",
"id": "56de3e414396321400ee26d9",
"answers": [
{
"text": "William of Montreuil",
"answer_start": 380
},
{
"text": "William of Montreuil",
"answer_start": 380
},
{
"text": "William of Montreuil",
"answer_start": 380
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "Antioch",
"answer_start": 142
}
],
"question": "Where did the Normans carve out a principality before the First Crusade?",
"id": "5ad3fc41604f3c001a3ffb8f",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Reconquista in Iberia",
"answer_start": 195
}
],
"question": "What did the Normans take part in in the 10th century?",
"id": "5ad3fc41604f3c001a3ffb90",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Roger de Tosny",
"answer_start": 227
}
],
"question": "Who carved out a state for himself from Moorish lands?",
"id": "5ad3fc41604f3c001a3ffb91",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "the War of Barbastro",
"answer_start": 358
}
],
"question": "What war occured in the 1oth century?",
"id": "5ad3fc41604f3c001a3ffb92",
"answers": [],
"is_impossible": true
}
],
"context": "The legendary religious zeal of the Normans was exercised in religious wars long before the First Crusade carved out a Norman principality in Antioch. They were major foreign participants in the Reconquista in Iberia. In 1018, Roger de Tosny travelled to the Iberian Peninsula to carve out a state for himself from Moorish lands, but failed. In 1064, during the War of Barbastro, William of Montreuil led the papal army and took a huge booty."
},
{
"qas": [
{
"question": "When did the Siege of Antioch take place?",
"id": "56de3ebc4396321400ee26e6",
"answers": [
{
"text": "1097",
"answer_start": 267
},
{
"text": "1097",
"answer_start": 267
},
{
"text": "1097",
"answer_start": 267
}
],
"is_impossible": false
},
{
"question": "What was the name of Bohemond's nephew?",
"id": "56de3ebc4396321400ee26e7",
"answers": [
{
"text": "Tancred",
"answer_start": 100
},
{
"text": "Tancred",
"answer_start": 100
},
{
"text": "Tancred",
"answer_start": 100
}
],
"is_impossible": false
},
{
"question": "What major conquest did Tancred play a roll in?",
"id": "56de3ebc4396321400ee26e8",
"answers": [
{
"text": "Jerusalem",
"answer_start": 390
},
{
"text": "Jerusalem",
"answer_start": 390
},
{
"text": "Jerusalem",
"answer_start": 390
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "1097",
"answer_start": 267
}
],
"question": "When did Tancred lay siege to Antioch?",
"id": "5ad4017a604f3c001a3ffd1f",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Bohemond",
"answer_start": 273
}
],
"question": "What was the name of Tancred's nephew?",
"id": "5ad4017a604f3c001a3ffd20",
"answers": [],
"is_impossible": true
}
],
"context": "In 1096, Crusaders passing by the siege of Amalfi were joined by Bohemond of Taranto and his nephew Tancred with an army of Italo-Normans. Bohemond was the de facto leader of the Crusade during its passage through Asia Minor. After the successful Siege of Antioch in 1097, Bohemond began carving out an independent principality around that city. Tancred was instrumental in the conquest of Jerusalem and he worked for the expansion of the Crusader kingdom in Transjordan and the region of Galilee.[citation needed]"
},
{
"qas": [
{
"question": "How long did Western Europe control Cyprus?",
"id": "56de3efccffd8e1900b4b6fe",
"answers": [
{
"text": "380 years",
"answer_start": 189
},
{
"text": "380 years",
"answer_start": 189
},
{
"text": "380 years",
"answer_start": 189
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "Cyprus",
"answer_start": 16
}
],
"question": "Who defeated Anglo-Norman forces during the third Crusade?",
"id": "5ad401f2604f3c001a3ffd41",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Cyprus",
"answer_start": 16
}
],
"question": "Who dominated Western Europe for 380 years?",
"id": "5ad401f2604f3c001a3ffd42",
"answers": [],
"is_impossible": true
}
],
"context": "The conquest of Cyprus by the Anglo-Norman forces of the Third Crusade opened a new chapter in the history of the island, which would be under Western European domination for the following 380 years. Although not part of a planned operation, the conquest had much more permanent results than initially expected."
},
{
"qas": [
{
"question": "What ruined Richard's plans to reach Acre?",
"id": "56de3f784396321400ee26fa",
"answers": [
{
"text": "a storm",
"answer_start": 99
},
{
"text": "a storm",
"answer_start": 99
},
{
"text": "a storm",
"answer_start": 99
}
],
"is_impossible": false
},
{
"question": "Who was Richard's fiancee?",
"id": "56de3f784396321400ee26fb",
"answers": [
{
"text": "Berengaria",
"answer_start": 218
},
{
"text": "Berengaria",
"answer_start": 218
},
{
"text": "Berengaria",
"answer_start": 218
}
],
"is_impossible": false
},
{
"question": "What year did the storm hit Richard's fleet?",
"id": "56de3f784396321400ee26fc",
"answers": [
{
"text": "1191",
"answer_start": 9
},
{
"text": "1191",
"answer_start": 9
},
{
"text": "1191",
"answer_start": 9
}
],
"is_impossible": false
},
{
"question": "Who ruled Cyprus in 1191?",
"id": "56de3f784396321400ee26fd",
"answers": [
{
"text": "Isaac Komnenos",
"answer_start": 421
},
{
"text": "Isaac",
"answer_start": 522
},
{
"text": "Isaac Komnenos",
"answer_start": 421
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "Richard the Lion-hearted",
"answer_start": 14
}
],
"question": "Who left Messina in the 11th century?",
"id": "5ad40280604f3c001a3ffd57",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "1191",
"answer_start": 446
}
],
"question": "What year did Richards fleet avoid a storm?",
"id": "5ad40280604f3c001a3ffd58",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Isaac Komnenos",
"answer_start": 421
}
],
"question": "Who ruled Cyprus in the 11th century?",
"id": "5ad40280604f3c001a3ffd59",
"answers": [],
"is_impossible": true
}
],
"context": "In April 1191 Richard the Lion-hearted left Messina with a large fleet in order to reach Acre. But a storm dispersed the fleet. After some searching, it was discovered that the boat carrying his sister and his fiancée Berengaria was anchored on the south coast of Cyprus, together with the wrecks of several other ships, including the treasure ship. Survivors of the wrecks had been taken prisoner by the island's despot Isaac Komnenos. On 1 May 1191, Richard's fleet arrived in the port of Limassol on Cyprus. He ordered Isaac to release the prisoners and the treasure. Isaac refused, so Richard landed his troops and took Limassol."
},
{
"qas": [
{
"question": "Who was Guy's Rival?",
"id": "56de40da4396321400ee2708",
"answers": [
{
"text": "Conrad of Montferrat",
"answer_start": 188
},
{
"text": "Conrad of Montferrat",
"answer_start": 188
},
{
"text": "Conrad of Montferrat",
"answer_start": 188
}
],
"is_impossible": false
},
{
"question": "What were Isaac's chains made out of?",
"id": "56de40da4396321400ee2709",
"answers": [
{
"text": "silver",
"answer_start": 565
},
{
"text": "silver",
"answer_start": 565
},
{
"text": "silver",
"answer_start": 565
}
],
"is_impossible": false
},
{
"question": "Who led Richard's troops when Cyprus was conquered?",
"id": "56de40da4396321400ee270a",
"answers": [
{
"text": "Guy de Lusignan",
"answer_start": 85
},
{
"text": "Guy de Lusignan",
"answer_start": 508
},
{
"text": "Guy de Lusignan",
"answer_start": 508
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "Isaac",
"answer_start": 525
}
],
"question": "Who's chains were made out of copper?",
"id": "5ad404a6604f3c001a3ffde1",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Richard",
"answer_start": 588
}
],
"question": "Who led Issacs troops to Cyprus?",
"id": "5ad404a6604f3c001a3ffde2",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Richard",
"answer_start": 658
}
],
"question": "Who offered Issac his daughter?",
"id": "5ad404a6604f3c001a3ffde3",
"answers": [],
"is_impossible": true
}
],
"context": "Various princes of the Holy Land arrived in Limassol at the same time, in particular Guy de Lusignan. All declared their support for Richard provided that he support Guy against his rival Conrad of Montferrat. The local barons abandoned Isaac, who considered making peace with Richard, joining him on the crusade, and offering his daughter in marriage to the person named by Richard. But Isaac changed his mind and tried to escape. Richard then proceeded to conquer the whole island, his troops being led by Guy de Lusignan. Isaac surrendered and was confined with silver chains, because Richard had promised that he would not place him in irons. By 1 June, Richard had conquered the whole island. His exploit was well publicized and contributed to his reputation; he also derived significant financial gains from the conquest of the island. Richard left for Acre on 5 June, with his allies. Before his departure, he named two of his Norman generals, Richard de Camville and Robert de Thornham, as governors of Cyprus."
},
{
"qas": [
{
"question": "What continent are the Canarian Islands off the coast of?",
"id": "56de49564396321400ee277a",
"answers": [
{
"text": "Africa",
"answer_start": 219
},
{
"text": "Africa",
"answer_start": 219
},
{
"text": "Africa",
"answer_start": 219
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "Jean de Bethencourt and the Poitevine Gadifer de la Salle",
"answer_start": 62
}
],
"question": "Who conquered the Canary Island in the 14th century?",
"id": "5ad40419604f3c001a3ffdb7",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Canarian islands",
"answer_start": 134
}
],
"question": "What Islands are of the coast of Asia?",
"id": "5ad40419604f3c001a3ffdb8",
"answers": [],
"is_impossible": true
}
],
"context": "Between 1402 and 1405, the expedition led by the Norman noble Jean de Bethencourt and the Poitevine Gadifer de la Salle conquered the Canarian islands of Lanzarote, Fuerteventura and El Hierro off the Atlantic coast of Africa. Their troops were gathered in Normandy, Gascony and were later reinforced by Castilian colonists."
},
{
"qas": [
{
"question": "Who became the King of the Canary Islands?",
"id": "56de49a8cffd8e1900b4b7a7",
"answers": [
{
"text": "Bethencourt",
"answer_start": 0
},
{
"text": "Bethencourt",
"answer_start": 0
},
{
"text": "Bethencourt",
"answer_start": 0
}
],
"is_impossible": false
},
{
"question": "Who bought the rights?",
"id": "56de49a8cffd8e1900b4b7a8",
"answers": [
{
"text": "Enrique Pérez de Guzmán",
"answer_start": 172
},
{
"text": "Enrique Pérez de Guzmán",
"answer_start": 172
},
{
"text": "Enrique Pérez de Guzmán",
"answer_start": 172
}
],
"is_impossible": false
},
{
"question": "Who sold the rights?",
"id": "56de49a8cffd8e1900b4b7a9",
"answers": [
{
"text": "Maciot de Bethencourt",
"answer_start": 116
},
{
"text": "Maciot de Bethencourt",
"answer_start": 116
},
{
"text": "Maciot de Bethencourt",
"answer_start": 116
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "King of the Canary Islands",
"answer_start": 30
}
],
"question": "What title did Henry II take in the Canary Island?",
"id": "5ad403c1604f3c001a3ffd97",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Maciot de Bethencourt",
"answer_start": 116
}
],
"question": "Who sold the rights to the island in the 14th century?",
"id": "5ad403c1604f3c001a3ffd98",
"answers": [],
"is_impossible": true
}
],
"context": "Bethencourt took the title of King of the Canary Islands, as vassal to Henry III of Castile. In 1418, Jean's nephew Maciot de Bethencourt sold the rights to the islands to Enrique Pérez de Guzmán, 2nd Count de Niebla."
},
{
"qas": [
{
"question": "Where are Jersey and Guernsey",
"id": "56de4a474396321400ee2786",
"answers": [
{
"text": "Channel Islands",
"answer_start": 155
},
{
"text": "the Channel Islands",
"answer_start": 151
},
{
"text": "the Channel Islands",
"answer_start": 151
}
],
"is_impossible": false
},
{
"question": "How many customaries does Norman customary law have?",
"id": "56de4a474396321400ee2787",
"answers": [
{
"text": "two",
"answer_start": 212
},
{
"text": "two",
"answer_start": 212
},
{
"text": "two",
"answer_start": 212
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "The customary law of Normandy",
"answer_start": 0
}
],
"question": "What Norman law wasdeveloped between 1000 and 1300?",
"id": "5ad40358604f3c001a3ffd7d",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Norman customary law",
"answer_start": 172
}
],
"question": "What law has 3 customeries?",
"id": "5ad40358604f3c001a3ffd7e",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Summa de legibus Normanniae in curia laïcali)",
"answer_start": 461
}
],
"question": "What was authored in the 12th century?",
"id": "5ad40358604f3c001a3ffd7f",
"answers": [],
"is_impossible": true
}
],
"context": "The customary law of Normandy was developed between the 10th and 13th centuries and survives today through the legal systems of Jersey and Guernsey in the Channel Islands. Norman customary law was transcribed in two customaries in Latin by two judges for use by them and their colleagues: These are the Très ancien coutumier (Very ancient customary), authored between 1200 and 1245; and the Grand coutumier de Normandie (Great customary of Normandy, originally Summa de legibus Normanniae in curia laïcali), authored between 1235 and 1245."
},
{
"qas": [
{
"question": "What is the Norman architecture idiom?",
"id": "56de4a89cffd8e1900b4b7bd",
"answers": [
{
"text": "Romanesque",
"answer_start": 135
},
{
"text": "Romanesque",
"answer_start": 135
},
{
"text": "Romanesque",
"answer_start": 135
}
],
"is_impossible": false
},
{
"question": "What kind of arches does Norman architecture have?",
"id": "56de4a89cffd8e1900b4b7be",
"answers": [
{
"text": "rounded",
"answer_start": 332
},
{
"text": "rounded",
"answer_start": 332
},
{
"text": "rounded",
"answer_start": 332
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "rounded arches",
"answer_start": 332
}
],
"question": "What type of arch did the Normans invent?",
"id": "5ad402ce604f3c001a3ffd67",
"answers": [],
"is_impossible": true
}
],
"context": "Norman architecture typically stands out as a new stage in the architectural history of the regions they subdued. They spread a unique Romanesque idiom to England and Italy, and the encastellation of these regions with keeps in their north French style fundamentally altered the military landscape. Their style was characterised by rounded arches, particularly over windows and doorways, and massive proportions."
},
{
"qas": [
{
"question": "What architecture type came after Norman in England?",
"id": "56de4b074396321400ee2793",
"answers": [
{
"text": "Early Gothic",
"answer_start": 108
},
{
"text": "Early Gothic",
"answer_start": 108
},
{
"text": "Early Gothic",
"answer_start": 108
}
],
"is_impossible": false
},
{
"question": "What architecture type came before Norman in England?",
"id": "56de4b074396321400ee2794",
"answers": [
{
"text": "Anglo-Saxon",
"answer_start": 79
},
{
"text": "Anglo-Saxon",
"answer_start": 79
},
{
"text": "Anglo-Saxon",
"answer_start": 79
}
],
"is_impossible": false
},
{
"question": "What place had the Norman Arab architectural style?",
"id": "56de4b074396321400ee2795",
"answers": [
{
"text": "Sicily",
"answer_start": 328
},
{
"text": "Sicily",
"answer_start": 328
},
{
"text": "Kingdom of Sicily",
"answer_start": 317
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "the period of Norman architecture",
"answer_start": 12
}
],
"question": "What precedes the period of Anglo-Saxon architecture?",
"id": "5ad400b0604f3c001a3ffcdf",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Anglo-Saxon",
"answer_start": 79
}
],
"question": "What architecture type came after Early Gothic?",
"id": "5ad400b0604f3c001a3ffce0",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Normans",
"answer_start": 145
}
],
"question": "Who incorperated Islamic, LOmbard, and Byzantine building techniques in England?",
"id": "5ad400b0604f3c001a3ffce1",
"answers": [],
"is_impossible": true
}
],
"context": "In England, the period of Norman architecture immediately succeeds that of the Anglo-Saxon and precedes the Early Gothic. In southern Italy, the Normans incorporated elements of Islamic, Lombard, and Byzantine building techniques into their own, initiating a unique style known as Norman-Arab architecture within the Kingdom of Sicily."
},
{
"qas": [
{
"question": "When did the church reform begin?",
"id": "56de4b5c4396321400ee2799",
"answers": [
{
"text": "early 11th century",
"answer_start": 129
},
{
"text": "11th century",
"answer_start": 135
},
{
"text": "in the early 11th century",
"answer_start": 122
}
],
"is_impossible": false
},
{
"question": "Who used the church to unify themselves?",
"id": "56de4b5c4396321400ee279a",
"answers": [
{
"text": "dukes",
"answer_start": 152
},
{
"text": "the dukes",
"answer_start": 422
},
{
"text": "dukes",
"answer_start": 426
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "visual arts",
"answer_start": 7
}
],
"question": "What kind of art did the Normans have a rich tradition of?",
"id": "5ad3ffd7604f3c001a3ffca7",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "the dukes",
"answer_start": 148
}
],
"question": "Who began a program of church reform in the 1100s",
"id": "5ad3ffd7604f3c001a3ffca8",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "the dukes",
"answer_start": 148
}
],
"question": "Who was divided by the church?",
"id": "5ad3ffd7604f3c001a3ffca9",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Normandy",
"answer_start": 859
}
],
"question": "Who experienced aa golden age in the 1100s and 1200s",
"id": "5ad3ffd7604f3c001a3ffcaa",
"answers": [],
"is_impossible": true
}
],
"context": "In the visual arts, the Normans did not have the rich and distinctive traditions of the cultures they conquered. However, in the early 11th century the dukes began a programme of church reform, encouraging the Cluniac reform of monasteries and patronising intellectual pursuits, especially the proliferation of scriptoria and the reconstitution of a compilation of lost illuminated manuscripts. The church was utilised by the dukes as a unifying force for their disparate duchy. The chief monasteries taking part in this \"renaissance\" of Norman art and scholarship were Mont-Saint-Michel, Fécamp, Jumièges, Bec, Saint-Ouen, Saint-Evroul, and Saint-Wandrille. These centres were in contact with the so-called \"Winchester school\", which channeled a pure Carolingian artistic tradition to Normandy. In the final decade of the 11th and first of the 12th century, Normandy experienced a golden age of illustrated manuscripts, but it was brief and the major scriptoria of Normandy ceased to function after the midpoint of the century."
},
{
"qas": [
{
"question": "When were the French wars of religion?",
"id": "56de4bb84396321400ee27a2",
"answers": [
{
"text": "16th century",
"answer_start": 35
},
{
"text": "the 16th century",
"answer_start": 31
},
{
"text": "in the 16th century",
"answer_start": 28
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "The French Wars of Religion",
"answer_start": 0
}
],
"question": "What wars did France fight in the 1600s?",
"id": "5ad3ff1b604f3c001a3ffc73",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "French Revolution",
"answer_start": 52
}
],
"question": "What revolution was fought in the 1899's?",
"id": "5ad3ff1b604f3c001a3ffc74",
"answers": [],
"is_impossible": true
}
],
"context": "The French Wars of Religion in the 16th century and French Revolution in the 18th successively destroyed much of what existed in the way of the architectural and artistic remnant of this Norman creativity. The former, with their violence, caused the wanton destruction of many Norman edifices; the latter, with its assault on religion, caused the purposeful destruction of religious objects of any type, and its destabilisation of society resulted in rampant pillaging."
},
{
"qas": [
{
"question": "What kind of needlework was used in the creation of the Bayeux Tapestry?",
"id": "56de4c324396321400ee27ab",
"answers": [
{
"text": "embroidery",
"answer_start": 104
},
{
"text": "embroidery",
"answer_start": 104
},
{
"text": "embroidery",
"answer_start": 104
}
],
"is_impossible": false
},
{
"question": "What is Norman art's most well known piece?",
"id": "56de4c324396321400ee27ac",
"answers": [
{
"text": "Bayeux Tapestry",
"answer_start": 49
},
{
"text": "the Bayeux Tapestry",
"answer_start": 45
},
{
"text": "the Bayeux Tapestry",
"answer_start": 45
}
],
"is_impossible": false
},
{
"question": "Who commissioned the Tapestry?",
"id": "56de4c324396321400ee27ad",
"answers": [
{
"text": "Odo",
"answer_start": 139
},
{
"text": "Odo",
"answer_start": 139
},
{
"text": "Odo",
"answer_start": 139
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "the Bayeux Tapestry",
"answer_start": 45
}
],
"question": "What is the oldest work of Norman art?",
"id": "5ad3fe91604f3c001a3ffc47",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Odo",
"answer_start": 139
}
],
"question": "Who commissioned Danish vikings to create the Bayeux Tapestry?",
"id": "5ad3fe91604f3c001a3ffc48",
"answers": [],
"is_impossible": true
}
],
"context": "By far the most famous work of Norman art is the Bayeux Tapestry, which is not a tapestry but a work of embroidery. It was commissioned by Odo, the Bishop of Bayeux and first Earl of Kent, employing natives from Kent who were learned in the Nordic traditions imported in the previous half century by the Danish Vikings."
},
{
"qas": [
{
"question": "What is the most important type of Norman art preserved in churches?",
"id": "56de51244396321400ee27ef",
"answers": [
{
"text": "mosaics",
"answer_start": 466
},
{
"text": "mosaics",
"answer_start": 466
},
{
"text": "mosaics",
"answer_start": 466
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "as stonework or metalwork",
"answer_start": 42
}
],
"question": "How has British art survived in Normandy?",
"id": "5ad3fe0d604f3c001a3ffc1b",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "mosaics",
"answer_start": 466
}
],
"question": "What is the most common form of Norman art in churches?",
"id": "5ad3fe0d604f3c001a3ffc1c",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Lombard Salerno",
"answer_start": 549
}
],
"question": "What was a centre of ivorywork in the 1100s?",
"id": "5ad3fe0d604f3c001a3ffc1d",
"answers": [],
"is_impossible": true
}
],
"context": "In Britain, Norman art primarily survives as stonework or metalwork, such as capitals and baptismal fonts. In southern Italy, however, Norman artwork survives plentifully in forms strongly influenced by its Greek, Lombard, and Arab forebears. Of the royal regalia preserved in Palermo, the crown is Byzantine in style and the coronation cloak is of Arab craftsmanship with Arabic inscriptions. Many churches preserve sculptured fonts, capitals, and more importantly mosaics, which were common in Norman Italy and drew heavily on the Greek heritage. Lombard Salerno was a centre of ivorywork in the 11th century and this continued under Norman domination. Finally should be noted the intercourse between French Crusaders traveling to the Holy Land who brought with them French artefacts with which to gift the churches at which they stopped in southern Italy amongst their Norman cousins. For this reason many south Italian churches preserve works from France alongside their native pieces."
},
{
"qas": [
{
"question": "In what century did important classical music developments occur in Normandy?",
"id": "56de51c64396321400ee27f7",
"answers": [
{
"text": "11th",
"answer_start": 97
},
{
"text": "the 11th",
"answer_start": 93
},
{
"text": "11th",
"answer_start": 97
}
],
"is_impossible": false
},
{
"question": "Who were the two abbots at Fécamp Abbey?",
"id": "56de51c64396321400ee27f8",
"answers": [
{
"text": "William of Volpiano and John of Ravenna",
"answer_start": 234
},
{
"text": "William of Volpiano and John of Ravenna",
"answer_start": 234
},
{
"text": "William of Volpiano and John of Ravenna",
"answer_start": 234
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "classical music",
"answer_start": 74
}
],
"question": "What developed in Normandy during the 1100s?",
"id": "5ad3fd68604f3c001a3ffbe7",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "musical composition",
"answer_start": 632
}
],
"question": "What was Fecamp Abby the center of?",
"id": "5ad3fd68604f3c001a3ffbe8",
"answers": [],
"is_impossible": true
}
],
"context": "Normandy was the site of several important developments in the history of classical music in the 11th century. Fécamp Abbey and Saint-Evroul Abbey were centres of musical production and education. At Fécamp, under two Italian abbots, William of Volpiano and John of Ravenna, the system of denoting notes by letters was developed and taught. It is still the most common form of pitch representation in English- and German-speaking countries today. Also at Fécamp, the staff, around which neumes were oriented, was first developed and taught in the 11th century. Under the German abbot Isembard, La Trinité-du-Mont became a centre of musical composition."
},
{
"qas": [
{
"question": "Where did the monks flee to?",
"id": "56de52614396321400ee27fb",
"answers": [
{
"text": "southern Italy",
"answer_start": 179
},
{
"text": "southern Italy",
"answer_start": 179
},
{
"text": "southern Italy",
"answer_start": 179
}
],
"is_impossible": false
},
{
"question": "What monastery did the Saint-Evroul monks establish in Italy?",
"id": "56de52614396321400ee27fc",
"answers": [
{
"text": "Latin monastery at Sant'Eufemia.",
"answer_start": 259
},
{
"text": "a Latin monastery at Sant'Eufemia",
"answer_start": 257
},
{
"text": "Sant'Eufemia",
"answer_start": 278
}
],
"is_impossible": false
},
{
"question": "Who patronized the monks in Italy? ",
"id": "56de52614396321400ee27fd",
"answers": [
{
"text": "Robert Guiscard",
"answer_start": 225
},
{
"text": "Robert Guiscard",
"answer_start": 225
},
{
"text": "Robert Guiscard",
"answer_start": 225
}
],
"is_impossible": false
},
{
"question": "What tradition were the Saint-Evroul monks known for?",
"id": "56de52614396321400ee27fe",
"answers": [
{
"text": "singing",
"answer_start": 32
},
{
"text": "singing",
"answer_start": 32
},
{
"text": "singing",
"answer_start": 330
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "monks",
"answer_start": 149
}
],
"question": "Who fled from southern Italy?",
"id": "5ad3fccf604f3c001a3ffbb5",
"answers": [],
"is_impossible": true
}
],
"context": "At Saint Evroul, a tradition of singing had developed and the choir achieved fame in Normandy. Under the Norman abbot Robert de Grantmesnil, several monks of Saint-Evroul fled to southern Italy, where they were patronised by Robert Guiscard and established a Latin monastery at Sant'Eufemia. There they continued the tradition of singing."
}
]
},
{
"title": "Computational_complexity_theory",
"paragraphs": [
{
"qas": [
{
"question": "What branch of theoretical computer science deals with broadly classifying computational problems by difficulty and class of relationship?",
"id": "56e16182e3433e1400422e28",
"answers": [
{
"text": "Computational complexity theory",
"answer_start": 0
},
{
"text": "Computational complexity theory",
"answer_start": 0
},
{
"text": "Computational complexity theory",
"answer_start": 0
}
],
"is_impossible": false
},
{
"question": "By what main attribute are computational problems classified utilizing computational complexity theory? ",
"id": "56e16182e3433e1400422e29",
"answers": [
{
"text": "inherent difficulty",
"answer_start": 175
},
{
"text": "their inherent difficulty",
"answer_start": 169
},
{
"text": "inherent difficulty",
"answer_start": 175
}
],
"is_impossible": false
},
{
"question": "What is the term for a task that generally lends itself to being solved by a computer?",
"id": "56e16182e3433e1400422e2a",
"answers": [
{
"text": "computational problems",
"answer_start": 133
},
{
"text": "A computational problem",
"answer_start": 238
},
{
"text": "computational problem",
"answer_start": 240
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "is a branch of the theory of computation in theoretical computer science that focuses on classifying computational problems",
"answer_start": 32
}
],
"question": "What is computational complexity principle?",
"id": "5ad5316b5b96ef001a10ab72",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Computational complexity theory",
"answer_start": 0
}
],
"question": "What branch of theoretical computer class deals with broadly classifying computational problems by difficulty and class of relationship?",
"id": "5ad5316b5b96ef001a10ab73",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "computational problem",
"answer_start": 240
}
],
"question": "What is understood to be a task that is in principle not amendable to being solved by a computer?",
"id": "5ad5316b5b96ef001a10ab74",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "computational problem",
"answer_start": 240
}
],
"question": " What cannot be solved by mechanical application of mathematical steps?",
"id": "5ad5316b5b96ef001a10ab75",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "algorithm",
"answer_start": 472
}
],
"question": "What is a manual application of mathematical steps?",
"id": "5ad5316b5b96ef001a10ab76",
"answers": [],
"is_impossible": true
}
],
"context": "Computational complexity theory is a branch of the theory of computation in theoretical computer science that focuses on classifying computational problems according to their inherent difficulty, and relating those classes to each other. A computational problem is understood to be a task that is in principle amenable to being solved by a computer, which is equivalent to stating that the problem may be solved by mechanical application of mathematical steps, such as an algorithm."
},
{
"qas": [
{
"question": "What measure of a computational problem broadly defines the inherent difficulty of the solution?",
"id": "56e16839cd28a01900c67887",
"answers": [
{
"text": "if its solution requires significant resources",
"answer_start": 46
},
{
"text": "its solution requires significant resources",
"answer_start": 49
},
{
"text": "if its solution requires significant resources",
"answer_start": 46
}
],
"is_impossible": false
},
{
"question": "What method is used to intuitively assess or quantify the amount of resources required to solve a computational problem?",
"id": "56e16839cd28a01900c67888",
"answers": [
{
"text": "mathematical models of computation",
"answer_start": 176
},
{
"text": "mathematical models of computation",
"answer_start": 176
},
{
"text": "mathematical models of computation",
"answer_start": 176
}
],
"is_impossible": false
},
{
"question": "What are two basic primary resources used to guage complexity?",
"id": "56e16839cd28a01900c67889",
"answers": [
{
"text": "time and storage",
"answer_start": 305
},
{
"text": "time and storage",
"answer_start": 305
},
{
"text": "time and storage",
"answer_start": 305
}
],
"is_impossible": false
},
{
"question": "What unit is measured to determine circuit complexity?",
"id": "56e16839cd28a01900c6788a",
"answers": [
{
"text": "number of gates in a circuit",
"answer_start": 440
},
{
"text": "number of gates in a circuit",
"answer_start": 440
},
{
"text": "number of gates",
"answer_start": 440
}
],
"is_impossible": false
},
{
"question": "What practical role does defining the complexity of problems play in everyday computing?",
"id": "56e16839cd28a01900c6788b",
"answers": [
{
"text": "determine the practical limits on what computers can and cannot do",
"answer_start": 615
},
{
"text": "what computers can and cannot do",
"answer_start": 649
},
{
"text": "determine the practical limits on what computers can and cannot do",
"answer_start": 615
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "if its solution requires significant resources",
"answer_start": 46
}
],
"question": "What measure of computational problem broadly defines the inherent simplicity of the solution?",
"id": "5ad532575b96ef001a10ab7c",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "mathematical models of computation",
"answer_start": 176
}
],
"question": "What method is not used to intuitively assess or quantify the amount of resources required to solve a computational problem??",
"id": "5ad532575b96ef001a10ab7d",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "time and storage.",
"answer_start": 305
}
],
"question": "What are three basic primary resources used to gauge complexity?",
"id": "5ad532575b96ef001a10ab7e",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "the number of gates in a circuit",
"answer_start": 436
}
],
"question": "What unit is measured to determine circuit simplicity?",
"id": "5ad532575b96ef001a10ab7f",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "the number of processors",
"answer_start": 502
}
],
"question": "What number is used in perpendicular computing?",
"id": "5ad532575b96ef001a10ab80",
"answers": [],
"is_impossible": true
}
],
"context": "A problem is regarded as inherently difficult if its solution requires significant resources, whatever the algorithm used. The theory formalizes this intuition, by introducing mathematical models of computation to study these problems and quantifying the amount of resources needed to solve them, such as time and storage. Other complexity measures are also used, such as the amount of communication (used in communication complexity), the number of gates in a circuit (used in circuit complexity) and the number of processors (used in parallel computing). One of the roles of computational complexity theory is to determine the practical limits on what computers can and cannot do."
},
{
"qas": [
{
"question": "What two fields of theoretical computer science closely mirror computational complexity theory?",
"id": "56e17644e3433e1400422f40",
"answers": [
{
"text": "analysis of algorithms and computability theory",
"answer_start": 59
},
{
"text": "analysis of algorithms and computability theory",
"answer_start": 59
},
{
"text": "analysis of algorithms and computability theory",
"answer_start": 59
}
],
"is_impossible": false
},
{
"question": "What field of computer science analyzes the resource requirements of a specific algorithm isolated unto itself within a given problem?",
"id": "56e17644e3433e1400422f41",
"answers": [
{
"text": "analysis of algorithms",
"answer_start": 59
},
{
"text": "analysis of algorithms",
"answer_start": 134
},
{
"text": "analysis of algorithms",
"answer_start": 134
}
],
"is_impossible": false
},
{
"question": "What field of computer science analyzes all possible algorithms in aggregate to determine the resource requirements needed to solve to a given problem? ",
"id": "56e17644e3433e1400422f42",
"answers": [
{
"text": "computational complexity theory",
"answer_start": 161
},
{
"text": "computational complexity theory",
"answer_start": 161
},
{
"text": "computational complexity theory",
"answer_start": 161
}
],
"is_impossible": false
},
{
"question": "What field of computer science is primarily concerned with determining the likelihood of whether or not a problem can ultimately be solved using algorithms?",
"id": "56e17644e3433e1400422f43",
"answers": [
{
"text": "computability theory",
"answer_start": 86
},
{
"text": "computability theory",
"answer_start": 663
},
{
"text": "computability theory",
"answer_start": 663
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "analysis of algorithms and computability theory.",
"answer_start": 59
}
],
"question": "What are two fields of theoretical computer science that closely mirror computational simplicity theory?",
"id": "5ad5344b5b96ef001a10ab86",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "e former is devoted to analyzing the amount of resources needed by a particular algorithm to solve a problem",
"answer_start": 203
}
],
"question": "What is not the key distinction between analysis of algorithms and computational complexity theory?",
"id": "5ad5344b5b96ef001a10ab87",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "analysis of algorithms",
"answer_start": 59
}
],
"question": "What is the process of analyzing the amount of resources needed by a particular algorithm to solve a hypothesis?",
"id": "5ad5344b5b96ef001a10ab88",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "computational complexity theory",
"answer_start": 161
}
],
"question": "What is the process that asks a more specific question about all possible algorithms that could not be used to solve the same problem?",
"id": "5ad5344b5b96ef001a10ab89",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "analysis of algorithms",
"answer_start": 59
}
],
"question": "What process classifies problems that can and cannot be solved with approximately unlimited resources?",
"id": "5ad5344b5b96ef001a10ab8a",
"answers": [],
"is_impossible": true
}
],
"context": "Closely related fields in theoretical computer science are analysis of algorithms and computability theory. A key distinction between analysis of algorithms and computational complexity theory is that the former is devoted to analyzing the amount of resources needed by a particular algorithm to solve a problem, whereas the latter asks a more general question about all possible algorithms that could be used to solve the same problem. More precisely, it tries to classify problems that can or cannot be solved with appropriately restricted resources. In turn, imposing restrictions on the available resources is what distinguishes computational complexity from computability theory: the latter theory asks what kind of problems can, in principle, be solved algorithmically."
},
{
"qas": [
{
"question": "What is the name given to the input string of a computational problem?",
"id": "56e17a7ccd28a01900c679a1",
"answers": [
{
"text": "problem instance",
"answer_start": 187
},
{
"text": "a problem instance",
"answer_start": 185
},
{
"text": "problem instance",
"answer_start": 187
}
],
"is_impossible": false
},
{
"question": "In computational complexity theory, what is the term given to describe the baseline abstract question needing to be solved? ",
"id": "56e17a7ccd28a01900c679a2",
"answers": [
{
"text": "the problem",
"answer_start": 237
},
{
"text": "a problem",
"answer_start": 293
},
{
"text": "problem",
"answer_start": 295
}
],
"is_impossible": false
},
{
"question": "Is a problem instance typically characterized as abstract or concrete?",
"id": "56e17a7ccd28a01900c679a3",
"answers": [
{
"text": "concrete",
"answer_start": 402
},
{
"text": "concrete",
"answer_start": 402
},
{
"text": "abstract",
"answer_start": 317
}
],
"is_impossible": false
},
{
"question": "What is another name for any given measure of input associated with a problem?",
"id": "56e17a7ccd28a01900c679a4",
"answers": [
{
"text": "instances",
"answer_start": 67
},
{
"text": "the instance",
"answer_start": 675
},
{
"text": "instance",
"answer_start": 679
}
],
"is_impossible": false
},
{
"question": "What is the general term used to describe the output to any given input in a problem instance?",
"id": "56e17a7ccd28a01900c679a5",
"answers": [
{
"text": "solution",
"answer_start": 93
},
{
"text": "the solution",
"answer_start": 730
},
{
"text": "solution",
"answer_start": 734
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "computational problem",
"answer_start": 2
}
],
"question": "What can be viewed as a limited collection of instances together with a solution for every instance?",
"id": "5ad5364c5b96ef001a10ab90",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "problem instance",
"answer_start": 187
}
],
"question": "What is the name given to the input string of a computational solution?",
"id": "5ad5364c5b96ef001a10ab91",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "the problem",
"answer_start": 237
}
],
"question": "What term refers to the concrete question to be solved?",
"id": "5ad5364c5b96ef001a10ab92",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "the solution",
"answer_start": 730
}
],
"question": "What is the output corresponding to the given question?",
"id": "5ad5364c5b96ef001a10ab93",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "the instance",
"answer_start": 675
}
],
"question": "What is a particular measure input associated with the a theory?",
"id": "5ad5364c5b96ef001a10ab94",
"answers": [],
"is_impossible": true
}
],
"context": "A computational problem can be viewed as an infinite collection of instances together with a solution for every instance. The input string for a computational problem is referred to as a problem instance, and should not be confused with the problem itself. In computational complexity theory, a problem refers to the abstract question to be solved. In contrast, an instance of this problem is a rather concrete utterance, which can serve as the input for a decision problem. For example, consider the problem of primality testing. The instance is a number (e.g. 15) and the solution is \"yes\" if the number is prime and \"no\" otherwise (in this case \"no\"). Stated another way, the instance is a particular input to the problem, and the solution is the output corresponding to the given input."
},
{
"qas": [
{
"question": "By how many kilometers does the traveling salesman problem seek to classify a route between the 15 largest cities in Germany?",
"id": "56e17e6ee3433e1400422f7f",
"answers": [
{
"text": "2000",
"answer_start": 190
},
{
"text": "2000",
"answer_start": 190
},
{
"text": "2000",
"answer_start": 190
}
],
"is_impossible": false
},
{
"question": "What is one example of an instance that the quantitative answer to the traveling salesman problem fails to answer?",
"id": "56e17e6ee3433e1400422f80",
"answers": [
{
"text": "round trip through all sites in Milan",
"answer_start": 400
},
{
"text": "asking for a round trip through all sites in Milan whose total length is at most 10 km",
"answer_start": 387
},
{
"text": "a round trip through all sites in Milan whose total length is at most 10 km",
"answer_start": 398
}
],
"is_impossible": false
},
{
"question": "What does computational complexity theory most specifically seek to answer? ",
"id": "56e17e6ee3433e1400422f81",
"answers": [
{
"text": "computational problems",
"answer_start": 520
},
{
"text": "computational problems",
"answer_start": 520
},
{
"text": "computational problems",
"answer_start": 520
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "2000",
"answer_start": 190
}
],
"question": "How many miles does the traveling salesman problem seek to classify a route between the 15 smallest cities in Germany?",
"id": "5ad537a15b96ef001a10ab9a",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "is of little use for solving other instances of the problem",
"answer_start": 318
}
],
"question": "What is the qualitative answer to this particular problem instance?",
"id": "5ad537a15b96ef001a10ab9b",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "round trip through all sites in Milan",
"answer_start": 400
}
],
"question": "What is one example of an instance that the qualitative answer to the traveling salesman fails to answer?",
"id": "5ad537a15b96ef001a10ab9c",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "computational problems",
"answer_start": 520
}
],
"question": "What does computational simplicity theory most specifically seek to answer?",
"id": "5ad537a15b96ef001a10ab9d",
"answers": [],
"is_impossible": true
}
],
"context": "To further highlight the difference between a problem and an instance, consider the following instance of the decision version of the traveling salesman problem: Is there a route of at most 2000 kilometres passing through all of Germany's 15 largest cities? The quantitative answer to this particular problem instance is of little use for solving other instances of the problem, such as asking for a round trip through all sites in Milan whose total length is at most 10 km. For this reason, complexity theory addresses computational problems and not particular problem instances."
},
{
"qas": [
{
"question": "In a computational problem, what can be described as a string over an alphabet?",
"id": "56e181d9e3433e1400422fa0",
"answers": [
{
"text": "problem instance",
"answer_start": 43
},
{
"text": "a problem instance",
"answer_start": 41
},
{
"text": "problem instance",
"answer_start": 43
}
],
"is_impossible": false
},
{
"question": "What is the name of the alphabet is most commonly used in a problem instance?",
"id": "56e181d9e3433e1400422fa1",
"answers": [
{
"text": "binary alphabet",
"answer_start": 131
},
{
"text": "binary",
"answer_start": 131
},
{
"text": "binary",
"answer_start": 131
}
],
"is_impossible": false
},
{
"question": "What is another term for the string of a problem instance?",
"id": "56e181d9e3433e1400422fa2",
"answers": [
{
"text": "bitstrings",
"answer_start": 195
},
{
"text": "bitstrings",
"answer_start": 195
},
{
"text": "bitstrings",
"answer_start": 195
}
],
"is_impossible": false
},
{
"question": "In the encoding of mathematical objects, what is the way in which integers are commonly expressed?",
"id": "56e181d9e3433e1400422fa3",
"answers": [
{
"text": "binary notation",
"answer_start": 349
},
{
"text": "binary notation",
"answer_start": 349
},
{
"text": "binary notation",
"answer_start": 349
}
],
"is_impossible": false
},
{
"question": "What is one way in which graphs can be encoded? ",
"id": "56e181d9e3433e1400422fa4",
"answers": [
{
"text": "adjacency matrices",
"answer_start": 411
},
{
"text": "directly via their adjacency matrices",
"answer_start": 392
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "problem instance",
"answer_start": 43
}
],
"question": "What is a string over a Greek number when considering a computational problem?",
"id": "5ad5391e5b96ef001a10aba2",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "binary alphabet",
"answer_start": 131
}
],
"question": "What is the name of the alphabet that is rarely used in a problem instance?",
"id": "5ad5391e5b96ef001a10aba3",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "bitstrings",
"answer_start": 195
}
],
"question": "What is another term for the the string of a problem question?",
"id": "5ad5391e5b96ef001a10aba4",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "integers",
"answer_start": 318
}
],
"question": "What is represented by non-binary notation in the encoding of mathematical objects?",
"id": "5ad5391e5b96ef001a10aba5",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "via their adjacency matrices, or by encoding their adjacency lists in binary.",
"answer_start": 401
}
],
"question": "How can graphs be encoded indirectly?",
"id": "5ad5391e5b96ef001a10aba6",
"answers": [],
"is_impossible": true
}
],
"context": "When considering computational problems, a problem instance is a string over an alphabet. Usually, the alphabet is taken to be the binary alphabet (i.e., the set {0,1}), and thus the strings are bitstrings. As in a real-world computer, mathematical objects other than bitstrings must be suitably encoded. For example, integers can be represented in binary notation, and graphs can be encoded directly via their adjacency matrices, or by encoding their adjacency lists in binary."
},
{
"qas": [
{
"question": "What kind of problems are one of the main topics studied in computational complexity theory?",
"id": "56e190bce3433e1400422fc8",
"answers": [
{
"text": "Decision problems",
"answer_start": 0
},
{
"text": "Decision problems",
"answer_start": 0
},
{
"text": "Decision",
"answer_start": 0
}
],
"is_impossible": false
},
{
"question": "What are the two simple word responses to a decision problem?",
"id": "56e190bce3433e1400422fc9",
"answers": [
{
"text": "yes or no",
"answer_start": 179
},
{
"text": "yes or no",
"answer_start": 179
},
{
"text": "yes or no",
"answer_start": 179
}
],
"is_impossible": false
},
{
"question": "What are the two integer responses to a decision problem?",
"id": "56e190bce3433e1400422fca",
"answers": [
{
"text": "1 or 0",
"answer_start": 212
},
{
"text": "1 or 0",
"answer_start": 212
},
{
"text": "1 or 0",
"answer_start": 212
}
],
"is_impossible": false
},
{
"question": "What will the output be for a member of the language of a decision problem?",
"id": "56e190bce3433e1400422fcb",
"answers": [
{
"text": "yes",
"answer_start": 179
},
{
"text": "yes",
"answer_start": 339
},
{
"text": "yes",
"answer_start": 339
}
],
"is_impossible": false
},
{
"question": "What answer denotes that an algorithm has accepted an input string?",
"id": "56e190bce3433e1400422fcc",
"answers": [
{
"text": "yes",
"answer_start": 179
},
{
"text": "yes",
"answer_start": 605
},
{
"text": "yes",
"answer_start": 605
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "Decision problems",
"answer_start": 0
}
],
"question": "What kind of solutions are one of the central objects of study in computational complexity theory?",
"id": "5ad53b9d5b96ef001a10abc8",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "A decision problem",
"answer_start": 94
}
],
"question": "What is a typical type of computational problem whose answer is either yer or no?",
"id": "5ad53b9d5b96ef001a10abc9",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "decision problem",
"answer_start": 222
}
],
"question": "What can be viewed as an informal language where the language instances whose input is yes?",
"id": "5ad53b9d5b96ef001a10abca",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "1 or 0",
"answer_start": 212
}
],
"question": "What are the three integer responses to a decision problem?",
"id": "5ad53b9d5b96ef001a10abcb",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "yes",
"answer_start": 339
}
],
"question": "What answer denotes that a solution has accepted an input string?",
"id": "5ad53b9d5b96ef001a10abcc",
"answers": [],
"is_impossible": true
}
],
"context": "Decision problems are one of the central objects of study in computational complexity theory. A decision problem is a special type of computational problem whose answer is either yes or no, or alternately either 1 or 0. A decision problem can be viewed as a formal language, where the members of the language are instances whose output is yes, and the non-members are those instances whose output is no. The objective is to decide, with the aid of an algorithm, whether a given input string is a member of the formal language under consideration. If the algorithm deciding this problem returns the answer yes, the algorithm is said to accept the input string, otherwise it is said to reject the input."
},
{
"qas": [
{
"question": "What kind of graph is an example of an input used in a decision problem?",
"id": "56e19557e3433e1400422fee",
"answers": [
{
"text": "arbitrary graph",
"answer_start": 67
},
{
"text": "arbitrary",
"answer_start": 67
},
{
"text": "arbitrary",
"answer_start": 67
}
],
"is_impossible": false
},
{
"question": "What is the term for the set of all connected graphs related to this decision problem?",
"id": "56e19557e3433e1400422ff0",
"answers": [
{
"text": "formal language",
"answer_start": 167
},
{
"text": "The formal language",
"answer_start": 163
},
{
"text": "The formal language associated with this decision problem",
"answer_start": 163
}
],
"is_impossible": false
},
{
"question": "What encoding decision needs to be made in order to determine an exact definition of the formal language?",
"id": "56e19557e3433e1400422ff1",
"answers": [
{
"text": "how graphs are encoded as binary strings",
"answer_start": 339
},
{
"text": "how graphs are encoded as binary strings",
"answer_start": 339
},
{
"text": "how graphs are encoded as binary strings",
"answer_start": 339
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "arbitrary graph.",
"answer_start": 67
}
],
"question": "What type of graph is an example of an output used in a decision problem?",
"id": "5ad53d705b96ef001a10abd2",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "formal language",
"answer_start": 167
}
],
"question": "What is the term for the set of all unconnected graphs related to this decision problem?",
"id": "5ad53d705b96ef001a10abd3",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "how graphs are encoded as binary strings.",
"answer_start": 339
}
],
"question": "What encoding decision needs to be made in order to determine an inaccurate definition of the formal language? ",
"id": "5ad53d705b96ef001a10abd4",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "one has to decide how graphs are encoded as binary strings.",
"answer_start": 321
}
],
"question": "How does one obtain an indefinite definition of this language?",
"id": "5ad53d705b96ef001a10abd5",
"answers": [],
"is_impossible": true
}
],
"context": "An example of a decision problem is the following. The input is an arbitrary graph. The problem consists in deciding whether the given graph is connected, or not. The formal language associated with this decision problem is then the set of all connected graphs—of course, to obtain a precise definition of this language, one has to decide how graphs are encoded as binary strings."
},
{
"qas": [
{
"question": "A function problem is an example of what?",
"id": "56e19724cd28a01900c679f6",
"answers": [
{
"text": "a computational problem",
"answer_start": 22
},
{
"text": "a computational problem",
"answer_start": 22
},
{
"text": "a computational problem",
"answer_start": 22
}
],
"is_impossible": false
},
{
"question": "How many outputs are expected for each input in a function problem?",
"id": "56e19724cd28a01900c679f7",
"answers": [
{
"text": "a single output",
"answer_start": 52
},
{
"text": "single",
"answer_start": 54
},
{
"text": "single",
"answer_start": 54
}
],
"is_impossible": false
},
{
"question": "The traveling salesman problem is an example of what type of problem?",
"id": "56e19724cd28a01900c679f8",
"answers": [
{
"text": "A function problem",
"answer_start": 0
},
{
"text": "function",
"answer_start": 2
},
{
"text": "function problem",
"answer_start": 2
}
],
"is_impossible": false
},
{
"question": "In addition to the traveling salesman problem, what is another example of a function problem?",
"id": "56e19724cd28a01900c679f9",
"answers": [
{
"text": "the integer factorization problem",
"answer_start": 277
},
{
"text": "integer factorization",
"answer_start": 281
},
{
"text": "integer factorization problem",
"answer_start": 281
}
],
"is_impossible": false
},
{
"question": "Is the output of a functional problem typically characterized by a simple or complex answer?",
"id": "56e19724cd28a01900c679fa",
"answers": [
{
"text": "complex",
"answer_start": 142
},
{
"text": "complex",
"answer_start": 142
},
{
"text": "complex",
"answer_start": 142
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "A function problem",
"answer_start": 0
}
],
"question": "What is a computational solution where a single input is expected for every input?",
"id": "5ad53e615b96ef001a10abda",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "A function problem",
"answer_start": 0
}
],
"question": "What is expected where a computational problems offers multiple outputs are expected for every input?",
"id": "5ad53e615b96ef001a10abdb",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "a computational problem",
"answer_start": 22
}
],
"question": "What is a function solution an example of?",
"id": "5ad53e615b96ef001a10abdc",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "the traveling salesman problem and the integer factorization problem.",
"answer_start": 242
}
],
"question": "What are other irrelevant examples of a function problem>",
"id": "5ad53e615b96ef001a10abdd",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "complex",
"answer_start": 142
}
],
"question": "Is the output of a functional solution typically characterized by a simple or complex answer?",
"id": "5ad53e615b96ef001a10abde",
"answers": [],
"is_impossible": true
}
],
"context": "A function problem is a computational problem where a single output (of a total function) is expected for every input, but the output is more complex than that of a decision problem, that is, it isn't just yes or no. Notable examples include the traveling salesman problem and the integer factorization problem."
},
{
"qas": [
{
"question": "How can function problems typically be restated?",
"id": "56e1a0dccd28a01900c67a2e",
"answers": [
{
"text": "decision problems",
"answer_start": 95
},
{
"text": "as decision problems",
"answer_start": 190
},
{
"text": "as decision problems",
"answer_start": 190
}
],
"is_impossible": false
},
{
"question": "If two integers are multiplied and output a value, what is this expression set called?",
"id": "56e1a0dccd28a01900c67a2f",
"answers": [
{
"text": "set of triples",
"answer_start": 284
},
{
"text": "triple",
"answer_start": 374
},
{
"text": "the set of triples (a, b, c) such that the relation a × b = c holds",
"answer_start": 280
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "function problems",
"answer_start": 158
}
],
"question": "What can not be restated as decision problems?",
"id": "5ad53f815b96ef001a10abe4",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "the set of triples",
"answer_start": 280
}
],
"question": "What is the expression set called where three integers are multiplied?",
"id": "5ad53f815b96ef001a10abe5",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Deciding whether a given triple is a member of this set",
"answer_start": 349
}
],
"question": "What corresponds to solving the problem of multiplying three numbers/",
"id": "5ad53f815b96ef001a10abe6",
"answers": [],
"is_impossible": true
}
],
"context": "It is tempting to think that the notion of function problems is much richer than the notion of decision problems. However, this is not really the case, since function problems can be recast as decision problems. For example, the multiplication of two integers can be expressed as the set of triples (a, b, c) such that the relation a × b = c holds. Deciding whether a given triple is a member of this set corresponds to solving the problem of multiplying two numbers."
},
{
"qas": [
{
"question": "What is a commonly used measurement used to determine the complexity of a computational problem?",
"id": "56e1a38de3433e140042305c",
"answers": [
{
"text": "how much time the best algorithm requires to solve the problem",
"answer_start": 82
},
{
"text": "time",
"answer_start": 91
},
{
"text": "time",
"answer_start": 91
}
],
"is_impossible": false
},
{
"question": "What is one variable on which the running time may be contingent?",
"id": "56e1a38de3433e140042305d",
"answers": [
{
"text": "the instance",
"answer_start": 199
},
{
"text": "the instance",
"answer_start": 199
},
{
"text": "the size of the instance",
"answer_start": 405
}
],
"is_impossible": false
},
{
"question": "How is the time needed to obtain the solution to a problem calculated?",
"id": "56e1a38de3433e140042305e",
"answers": [
{
"text": "as a function of the size of the instance",
"answer_start": 388
},
{
"text": "as a function of the size of the instance",
"answer_start": 388
},
{
"text": "a function of the size of the instance",
"answer_start": 391
}
],
"is_impossible": false
},
{
"question": "In what unit is the size of the input measured?",
"id": "56e1a38de3433e140042305f",
"answers": [
{
"text": "bits",
"answer_start": 484
},
{
"text": "bits",
"answer_start": 484
},
{
"text": "bits",
"answer_start": 484
}
],
"is_impossible": false
},
{
"question": "Complexity theory seeks to define the relationship between the scale of algorithms with respect to what other variable?",
"id": "56e1a38de3433e1400423060",
"answers": [
{
"text": "an increase in the input size",
"answer_start": 551
},
{
"text": "input size",
"answer_start": 570
},
{
"text": "input size",
"answer_start": 570
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "how much time the best algorithm requires to solve the problem",
"answer_start": 82
}
],
"question": "How does one measure the simplicity of a computational problem?",
"id": "5ad541ad5b96ef001a10abea",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "the instance.",
"answer_start": 417
}
],
"question": "What is one variable which the running of time be not be contingent?",
"id": "5ad541ad5b96ef001a10abeb",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "bits",
"answer_start": 484
}
],
"question": "How is the time needed to obtain the question to a problem calculated?",
"id": "5ad541ad5b96ef001a10abec",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Complexity theory",
"answer_start": 490
}
],
"question": "What is interested in how algorithms scale with a decrease in the input size?",
"id": "5ad541ad5b96ef001a10abed",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "as a function of the size of the instance.",
"answer_start": 388
}
],
"question": "How is time not required to solve a problem calculated?",
"id": "5ad541ad5b96ef001a10abee",
"answers": [],
"is_impossible": true
}
],
"context": "To measure the difficulty of solving a computational problem, one may wish to see how much time the best algorithm requires to solve the problem. However, the running time may, in general, depend on the instance. In particular, larger instances will require more time to solve. Thus the time required to solve a problem (or the space required, or any measure of complexity) is calculated as a function of the size of the instance. This is usually taken to be the size of the input in bits. Complexity theory is interested in how algorithms scale with an increase in the input size. For instance, in the problem of finding whether a graph is connected, how much more time does it take to solve a problem for a graph with 2n vertices compared to the time taken for a graph with n vertices?"
},
{
"qas": [
{
"question": "Whose thesis states that the solution to a problem is solvable with reasonable resources assuming it allows for a polynomial time algorithm?",
"id": "56e1a564cd28a01900c67a48",
"answers": [
{
"text": "Cobham's thesis",
"answer_start": 347
},
{
"text": "Cobham's",
"answer_start": 347
},
{
"text": "Cobham",
"answer_start": 347
}
],
"is_impossible": false
},
{
"question": "If input size is is equal to n, what can respectively be assumed is the function of n?",
"id": "56e1a564cd28a01900c67a49",
"answers": [
{
"text": "the time taken",
"answer_start": 24
},
{
"text": "the time taken",
"answer_start": 24
},
{
"text": "the time taken",
"answer_start": 24
}
],
"is_impossible": false
},
{
"question": "What term corresponds to the maximum measurement of time across all functions of n? ",
"id": "56e1a564cd28a01900c67a4a",
"answers": [
{
"text": "worst-case time complexity",
"answer_start": 156
},
{
"text": "worst-case time complexity",
"answer_start": 156
},
{
"text": "the worst-case time complexity",
"answer_start": 152
}
],
"is_impossible": false
},
{
"question": "How is worst-case time complexity written as an expression?",
"id": "56e1a564cd28a01900c67a4b",
"answers": [
{
"text": "T(n)",
"answer_start": 183
},
{
"text": "T(n)",
"answer_start": 183
},
{
"text": "T(n)",
"answer_start": 183
}
],
"is_impossible": false
},
{
"question": "Assuming that T represents a polynomial in T(n), what is the term given to the corresponding algorithm?",
"id": "56e1a564cd28a01900c67a4c",
"answers": [
{
"text": "polynomial time algorithm",
"answer_start": 320
},
{
"text": "polynomial time",
"answer_start": 320
},
{
"text": "polynomial time algorithm",
"answer_start": 320
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "the input size is n",
"answer_start": 3
}
],
"question": "How is time taken expressed as a function of x?",
"id": "5ad542db5b96ef001a10abf4",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Cobham's thesis",
"answer_start": 347
}
],
"question": "Whose hypothesis states the the solution to a problem is solvable with reasonable resources assuming it allows for monoinomial time algorithm?",
"id": "5ad542db5b96ef001a10abf5",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "the worst-case time complexity",
"answer_start": 152
}
],
"question": "What term corresponds to the minimum measurement of the time across all functions of n?",
"id": "5ad542db5b96ef001a10abf6",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "T(n)",
"answer_start": 258
}
],
"question": "How is best-case time complexity written as an expression?",
"id": "5ad542db5b96ef001a10abf7",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "polynomial time algorithm",
"answer_start": 448
}
],
"question": "What is the term given to the corresponding algorithm assuming that T represents a mononominal in T(n)?",
"id": "5ad542db5b96ef001a10abf8",
"answers": [],
"is_impossible": true
}
],
"context": "If the input size is n, the time taken can be expressed as a function of n. Since the time taken on different inputs of the same size can be different, the worst-case time complexity T(n) is defined to be the maximum time taken over all inputs of size n. If T(n) is a polynomial in n, then the algorithm is said to be a polynomial time algorithm. Cobham's thesis says that a problem can be solved with a feasible amount of resources if it admits a polynomial time algorithm."
},
{
"qas": [
{
"question": "What is the term for a mathematical model that theoretically represents a general computing machine?",
"id": "56e1aba0e3433e1400423094",
"answers": [
{
"text": "A Turing machine",
"answer_start": 0
},
{
"text": "A Turing machine",
"answer_start": 0
},
{
"text": "Turing machine",
"answer_start": 2
}
],
"is_impossible": false
},
{
"question": "It is generally assumed that a Turing machine can solve anything capable of also being solved using what?",
"id": "56e1aba0e3433e1400423095",
"answers": [
{
"text": "an algorithm",
"answer_start": 427
},
{
"text": "an algorithm",
"answer_start": 427
},
{
"text": "an algorithm",
"answer_start": 427
}
],
"is_impossible": false
},
{
"question": "What is the most commonplace model utilized in complexity theory?",
"id": "56e1aba0e3433e1400423097",
"answers": [
{
"text": "the Turing machine",
"answer_start": 924
},
{
"text": "the Turing machine",
"answer_start": 924
},
{
"text": "Turing machine",
"answer_start": 928
}
],
"is_impossible": false
},
{
"question": "What does a Turing machine handle on a strip of tape?",
"id": "56e1aba0e3433e1400423098",
"answers": [
{
"text": "symbols",
"answer_start": 117
},
{
"text": "symbols",
"answer_start": 117
},
{
"text": "symbols",
"answer_start": 117
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "A Turing machine",
"answer_start": 0
}
],
"question": "What a scientific model of a general computing machine?",
"id": "5ad543c05b96ef001a10abfe",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "A Turing machine",
"answer_start": 0
}
],
"question": "What is a scientific device that manipulates symbols contained on a strip of tape?",
"id": "5ad543c05b96ef001a10abff",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Turing machines",
"answer_start": 155
}
],
"question": "What are intended as a practical computing technology?",
"id": "5ad543c05b96ef001a10ac00",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "A Turing machine",
"answer_start": 0
}
],
"question": "What is a scientific experiment that can solve a problem by algorithms?",
"id": "5ad543c05b96ef001a10ac01",
"answers": [],
"is_impossible": true
}
],
"context": "A Turing machine is a mathematical model of a general computing machine. It is a theoretical device that manipulates symbols contained on a strip of tape. Turing machines are not intended as a practical computing technology, but rather as a thought experiment representing a computing machine—anything from an advanced supercomputer to a mathematician with a pencil and paper. It is believed that if a problem can be solved by an algorithm, there exists a Turing machine that solves the problem. Indeed, this is the statement of the Church–Turing thesis. Furthermore, it is known that everything that can be computed on other models of computation known to us today, such as a RAM machine, Conway's Game of Life, cellular automata or any programming language can be computed on a Turing machine. Since Turing machines are easy to analyze mathematically, and are believed to be as powerful as any other model of computation, the Turing machine is the most commonly used model in complexity theory."
},
{
"qas": [
{
"question": "What is generally considered to be the most basic iteration of a Turing machine?",
"id": "56e1aff7cd28a01900c67a68",
"answers": [
{
"text": "A deterministic Turing machine",
"answer_start": 0
},
{
"text": "deterministic",
"answer_start": 2
},
{
"text": "deterministic Turing machine",
"answer_start": 2
}
],
"is_impossible": false
},
{
"question": "What fixed set of factors determine the actions of a deterministic Turing machine",
"id": "56e1aff7cd28a01900c67a69",
"answers": [
{
"text": "rules",
"answer_start": 91
},
{
"text": "rules",
"answer_start": 91
},
{
"text": "a fixed set of rules to determine its future actions",
"answer_start": 76
}
],
"is_impossible": false
},
{
"question": "What is the term used to identify a deterministic Turing machine that has additional random bits?",
"id": "56e1aff7cd28a01900c67a6a",
"answers": [
{
"text": "A probabilistic Turing machine",
"answer_start": 130
},
{
"text": "probabilistic",
"answer_start": 132
},
{
"text": "probabilistic Turing machine",
"answer_start": 132
}
],
"is_impossible": false
},
{
"question": "What type of Turing machine is capable of multiple actions and extends into a variety of computational paths?",
"id": "56e1aff7cd28a01900c67a6b",
"answers": [
{
"text": "A non-deterministic Turing machine",
"answer_start": 398
},
{
"text": "non-deterministic",
"answer_start": 400
},
{
"text": "non-deterministic Turing machine",
"answer_start": 400
}
],
"is_impossible": false
},
{
"question": "What is the term given to algorithms that utilize random bits?",
"id": "56e1aff7cd28a01900c67a6c",
"answers": [
{
"text": "randomized algorithms",
"answer_start": 375
},
{
"text": "randomized algorithms",
"answer_start": 375
},
{
"text": "randomized algorithms",
"answer_start": 375
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "deterministic Turing machine",
"answer_start": 2
}
],
"question": "What uses a flexible set of rules to determine its future actions?",
"id": "5ad546c75b96ef001a10ac0e",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "probabilistic Turing machine",
"answer_start": 132
}
],
"question": "What is a deterministic Turing machine with an extra supply of random ribbons?",
"id": "5ad546c75b96ef001a10ac0f",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "The ability to make probabilistic decisions",
"answer_start": 232
}
],
"question": "What does not often help algorithms solve problems more efficiently?",
"id": "5ad546c75b96ef001a10ac10",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "non-deterministic Turing machine",
"answer_start": 400
}
],
"question": "Which machine allows the machine to have multiple possible past actions from a given state?",
"id": "5ad546c75b96ef001a10ac11",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "is that the Turing machine branches into many possible computational paths at each step, and if it solves the problem in any of these branches,",
"answer_start": 632
}
],
"question": "How is one way that one should not view non-determinism?",
"id": "5ad546c75b96ef001a10ac12",
"answers": [],
"is_impossible": true
}
],
"context": "A deterministic Turing machine is the most basic Turing machine, which uses a fixed set of rules to determine its future actions. A probabilistic Turing machine is a deterministic Turing machine with an extra supply of random bits. The ability to make probabilistic decisions often helps algorithms solve problems more efficiently. Algorithms that use random bits are called randomized algorithms. A non-deterministic Turing machine is a deterministic Turing machine with an added feature of non-determinism, which allows a Turing machine to have multiple possible future actions from a given state. One way to view non-determinism is that the Turing machine branches into many possible computational paths at each step, and if it solves the problem in any of these branches, it is said to have solved the problem. Clearly, this model is not meant to be a physically realizable model, it is just a theoretically interesting abstract machine that gives rise to particularly interesting complexity classes. For examples, see non-deterministic algorithm."
},
{
"qas": [
{
"question": "Turing machines are commonly employed to define what? ",
"id": "56e1b00ce3433e140042309e",
"answers": [
{
"text": "complexity classes",
"answer_start": 49
},
{
"text": "complexity classes",
"answer_start": 49
},
{
"text": "complexity classes",
"answer_start": 49
}
],
"is_impossible": false
},
{
"question": "What are two factors that directly effect how powerful a Turing machine may or may not be?",
"id": "56e1b00ce3433e140042309f",
"answers": [
{
"text": "time or space",
"answer_start": 330
},
{
"text": "time or space",
"answer_start": 330
},
{
"text": "time or space",
"answer_start": 330
}
],
"is_impossible": false
},
{
"question": "In the determination of complexity classes, what are two examples of types of Turing machines?",
"id": "56e1b00ce3433e14004230a1",
"answers": [
{
"text": "probabilistic Turing machines, non-deterministic Turing machines",
"answer_start": 108
},
{
"text": "probabilistic Turing machines, non-deterministic Turing machines",
"answer_start": 108
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "to define complexity classes,",
"answer_start": 39
}
],
"question": "What are many types of Turing machines not used for?",
"id": "5ad545545b96ef001a10ac06",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "time or space",
"answer_start": 330
}
],
"question": "What are three factors that directly effect how powerful a Turing machine may or may not be?",
"id": "5ad545545b96ef001a10ac07",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Turing machines",
"answer_start": 14
}
],
"question": "What machines are not equally powerful in principle?",
"id": "5ad545545b96ef001a10ac08",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Turing machines",
"answer_start": 241
}
],
"question": "What may not be more powerful than others when the resources of time or space of considered?",
"id": "5ad545545b96ef001a10ac09",
"answers": [],
"is_impossible": true
}
],
"context": "Many types of Turing machines are used to define complexity classes, such as deterministic Turing machines, probabilistic Turing machines, non-deterministic Turing machines, quantum Turing machines, symmetric Turing machines and alternating Turing machines. They are all equally powerful in principle, but when resources (such as time or space) are bounded, some of these may be more powerful than others."
},
{
"qas": [
{
"question": "What is an example of a machine model that deviates from a generally accepted multi-tape Turing machine?",
"id": "56e1b169cd28a01900c67a72",
"answers": [
{
"text": "random access machines",
"answer_start": 125
},
{
"text": "random access machines",
"answer_start": 125
},
{
"text": "random access machines",
"answer_start": 125
}
],
"is_impossible": false
},
{
"question": "In considering Turing machines and alternate variables, what measurement left unaffected by conversion between machine models? ",
"id": "56e1b169cd28a01900c67a73",
"answers": [
{
"text": "computational power",
"answer_start": 248
},
{
"text": "computational power",
"answer_start": 248
},
{
"text": "computational power",
"answer_start": 248
}
],
"is_impossible": false
},
{
"question": "What two resources commonly consumed by alternate models are typically known to vary?",
"id": "56e1b169cd28a01900c67a74",
"answers": [
{
"text": "time and memory",
"answer_start": 273
},
{
"text": "time and memory consumption",
"answer_start": 273
},
{
"text": "time and memory consumption",
"answer_start": 273
}
],
"is_impossible": false
},
{
"question": "What commonality do alternate machine models, such as random access machines, share with Turing machines?",
"id": "56e1b169cd28a01900c67a75",
"answers": [
{
"text": "the machines operate deterministically",
"answer_start": 382
},
{
"text": "deterministically",
"answer_start": 403
},
{
"text": "the machines operate deterministically",
"answer_start": 382
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "random access machines.",
"answer_start": 125
}
],
"question": "What is not an example of a machine model that deviates from a generally accepted multi-tape Turing machine?",
"id": "5ad547945b96ef001a10ac18",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "computational power",
"answer_start": 248
}
],
"question": "What measurement is affected by conversion between machine models?",
"id": "5ad547945b96ef001a10ac19",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "time and memory",
"answer_start": 273
}
],
"question": "What two resources are uncommonly consumed by alternate models and are typically known to vary?",
"id": "5ad547945b96ef001a10ac1a",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "that the machines operate deterministically.",
"answer_start": 377
}
],
"question": "What do all these models not have in common?",
"id": "5ad547945b96ef001a10ac1b",
"answers": [],
"is_impossible": true
}
],
"context": "Many machine models different from the standard multi-tape Turing machines have been proposed in the literature, for example random access machines. Perhaps surprisingly, each of these models can be converted to another without providing any extra computational power. The time and memory consumption of these alternate models may vary. What all these models have in common is that the machines operate deterministically."
},
{
"qas": [
{
"question": "What type of Turing machine can be characterized by checking multiple possibilities at the same time?",
"id": "56e1b355e3433e14004230b0",
"answers": [
{
"text": "non-deterministic",
"answer_start": 110
},
{
"text": "non-deterministic",
"answer_start": 110
},
{
"text": "non-deterministic Turing machine",
"answer_start": 110
}
],
"is_impossible": false
},
{
"question": "What often affects or facilitates ease of analysis in computational problems?",
"id": "56e1b355e3433e14004230b1",
"answers": [
{
"text": "unusual resources",
"answer_start": 76
},
{
"text": "more unusual resources",
"answer_start": 71
},
{
"text": "more unusual resources",
"answer_start": 71
}
],
"is_impossible": false
},
{
"question": "A non-deterministic Turing machine has the ability to capture what facet of useful analysis?",
"id": "56e1b355e3433e14004230b2",
"answers": [
{
"text": "mathematical models",
"answer_start": 402
},
{
"text": "mathematical models",
"answer_start": 402
},
{
"text": "branching",
"answer_start": 363
}
],
"is_impossible": false
},
{
"question": "What is the most critical resource in the analysis of computational problems associated with non-deterministic Turing machines?",
"id": "56e1b355e3433e14004230b3",
"answers": [
{
"text": "time",
"answer_start": 468
},
{
"text": "non-deterministic time",
"answer_start": 450
},
{
"text": "non-deterministic time",
"answer_start": 450
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "some computational problems",
"answer_start": 9
}
],
"question": "What is harder to analyze in terms of more unusual resources?",
"id": "5ad5489b5b96ef001a10ac2a",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "a non-deterministic Turing machine",
"answer_start": 108
}
],
"question": "What type of machine is a computational model that is not allowed to branch out to check many different possibilities at once?",
"id": "5ad5489b5b96ef001a10ac2b",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "non-deterministic Turing machine",
"answer_start": 249
}
],
"question": "What has a lot to do with how we physically want to compute algorithms?",
"id": "5ad5489b5b96ef001a10ac2c",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "non-deterministic Turing",
"answer_start": 249
}
],
"question": "What machine's branching does not exactly capture many of the mathematical models we want to analyze?",
"id": "5ad5489b5b96ef001a10ac2d",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "time",
"answer_start": 468
}
],
"question": "What is the least critical resource in the analysis of computational problems associated with non-deterministic Turing machines?",
"id": "5ad5489b5b96ef001a10ac2e",
"answers": [],
"is_impossible": true
}
],
"context": "However, some computational problems are easier to analyze in terms of more unusual resources. For example, a non-deterministic Turing machine is a computational model that is allowed to branch out to check many different possibilities at once. The non-deterministic Turing machine has very little to do with how we physically want to compute algorithms, but its branching exactly captures many of the mathematical models we want to analyze, so that non-deterministic time is a very important resource in analyzing computational problems."
},
{
"qas": [
{
"question": "The time required to output an answer on a deterministic Turing machine is expressed as what?",
"id": "56e1b62ecd28a01900c67aa3",
"answers": [
{
"text": "state transitions",
"answer_start": 261
},
{
"text": "the total number of state transitions, or steps",
"answer_start": 241
},
{
"text": "total number of state transitions, or steps, the machine makes before it halts and outputs the answer",
"answer_start": 245
}
],
"is_impossible": false
},
{
"question": "Complexity theory classifies problems based on what primary attribute?",
"id": "56e1b62ecd28a01900c67aa4",
"answers": [
{
"text": "difficulty",
"answer_start": 695
},
{
"text": "difficulty",
"answer_start": 695
},
{
"text": "difficulty",
"answer_start": 695
}
],
"is_impossible": false
},
{
"question": "What is the expression used to identify any given series of problems capable of being solved within time on a deterministic Turing machine?",
"id": "56e1b62ecd28a01900c67aa5",
"answers": [
{
"text": "DTIME(f(n))",
"answer_start": 873
},
{
"text": "DTIME(f(n)).",
"answer_start": 873
},
{
"text": "DTIME(f(n))",
"answer_start": 873
}
],
"is_impossible": false
},
{
"question": "What is the most critical resource measured to in assessing the determination of a Turing machine's ability to solve any given set of problems?",
"id": "56e1b62ecd28a01900c67aa6",
"answers": [
{
"text": "time",
"answer_start": 85
},
{
"text": "time",
"answer_start": 583
},
{
"text": "time",
"answer_start": 583
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "deterministic Turing machine",
"answer_start": 135
}
],
"question": "What is not used for a precise definition of what it means to solve a problem using a given amount of time and space?",
"id": "5ad54a375b96ef001a10ac48",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "within time f(n), if the time required by M on each input of length n is at most f(n).",
"answer_start": 402
}
],
"question": "How is Turing machine M said not to operate?",
"id": "5ad54a375b96ef001a10ac49",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "DTIME(f(n)).",
"answer_start": 873
}
],
"question": "What is the expression used to identify any given series of solutions capable of being solved within time on a deterministic Turing machine?",
"id": "5ad54a375b96ef001a10ac4a",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "time",
"answer_start": 427
}
],
"question": "What is the least critical resource measured in assessing the determination of a Turing machine's ability to solve any given set of problems?",
"id": "5ad54a375b96ef001a10ac4b",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "if there exists a Turing machine operating in time f(n) that solves the problem.",
"answer_start": 537
}
],
"question": "How can decision problem B be solved in time x(f)?",
"id": "5ad54a375b96ef001a10ac4c",
"answers": [],
"is_impossible": true
}
],
"context": "For a precise definition of what it means to solve a problem using a given amount of time and space, a computational model such as the deterministic Turing machine is used. The time required by a deterministic Turing machine M on input x is the total number of state transitions, or steps, the machine makes before it halts and outputs the answer (\"yes\" or \"no\"). A Turing machine M is said to operate within time f(n), if the time required by M on each input of length n is at most f(n). A decision problem A can be solved in time f(n) if there exists a Turing machine operating in time f(n) that solves the problem. Since complexity theory is interested in classifying problems based on their difficulty, one defines sets of problems based on some criteria. For instance, the set of problems solvable within time f(n) on a deterministic Turing machine is then denoted by DTIME(f(n))."
},
{
"qas": [
{
"question": "Time and space are both examples of what type of resource?",
"id": "56e1b754cd28a01900c67abc",
"answers": [
{
"text": "complexity resources",
"answer_start": 106
},
{
"text": "complexity resources",
"answer_start": 106
},
{
"text": "complexity",
"answer_start": 106
}
],
"is_impossible": false
},
{
"question": "A complexity resource can also be described as what other type of resource?",
"id": "56e1b754cd28a01900c67abd",
"answers": [
{
"text": "computational resource",
"answer_start": 170
},
{
"text": "computational",
"answer_start": 170
},
{
"text": "computational",
"answer_start": 170
}
],
"is_impossible": false
},
{
"question": "What is typically used to broadly define complexity measures?",
"id": "56e1b754cd28a01900c67abe",
"answers": [
{
"text": "Blum complexity axioms",
"answer_start": 248
},
{
"text": "the Blum complexity axioms",
"answer_start": 244
},
{
"text": "the Blum complexity axioms",
"answer_start": 244
}
],
"is_impossible": false
},
{
"question": "Communication complexity is an example of what type of measure?",
"id": "56e1b754cd28a01900c67abf",
"answers": [
{
"text": "Complexity measures",
"answer_start": 194
},
{
"text": "complexity measures",
"answer_start": 278
},
{
"text": "complexity",
"answer_start": 278
}
],
"is_impossible": false
},
{
"question": "Decision tree is an example of what type of measure?",
"id": "56e1b754cd28a01900c67ac0",
"answers": [
{
"text": "Complexity measures",
"answer_start": 194
},
{
"text": "complexity measures",
"answer_start": 278
},
{
"text": "complexity",
"answer_start": 396
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "Analogous definitions",
"answer_start": 0
}
],
"question": "What can not be made for space requirements?",
"id": "5ad54b035b96ef001a10ac52",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "time and space",
"answer_start": 67
}
],
"question": "What are the least well known complexity resources?",
"id": "5ad54b035b96ef001a10ac53",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "by the Blum complexity axioms.",
"answer_start": 241
}
],
"question": "How are complexity measures generally not defined?",
"id": "5ad54b035b96ef001a10ac54",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "include communication complexity, circuit complexity, and decision tree complexity.",
"answer_start": 324
}
],
"question": "What are other complexity measures not used in complexity theory?",
"id": "5ad54b035b96ef001a10ac55",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "complexity measures",
"answer_start": 278
}
],
"question": "What type of measure is communication complexity not an example of?",
"id": "5ad54b035b96ef001a10ac56",
"answers": [],
"is_impossible": true
}
],
"context": "Analogous definitions can be made for space requirements. Although time and space are the most well-known complexity resources, any complexity measure can be viewed as a computational resource. Complexity measures are very generally defined by the Blum complexity axioms. Other complexity measures used in complexity theory include communication complexity, circuit complexity, and decision tree complexity."
},
{
"qas": [
{
"question": "What are the three primary expressions used to represent case complexity?",
"id": "56e1b8f3e3433e14004230e6",
"answers": [
{
"text": "best, worst and average",
"answer_start": 4
},
{
"text": "best, worst and average case",
"answer_start": 4
},
{
"text": "best, worst and average case complexity",
"answer_start": 4
}
],
"is_impossible": false
},
{
"question": "Case complexity likelihoods provide variable probabilities of what general measure? ",
"id": "56e1b8f3e3433e14004230e7",
"answers": [
{
"text": "complexity measure",
"answer_start": 121
},
{
"text": "complexity",
"answer_start": 121
},
{
"text": "complexity",
"answer_start": 121
}
],
"is_impossible": false
},
{
"question": "What is one common example of a critical complexity measure?",
"id": "56e1b8f3e3433e14004230e8",
"answers": [
{
"text": "time",
"answer_start": 91
},
{
"text": "time complexity",
"answer_start": 91
},
{
"text": "time complexity",
"answer_start": 91
}
],
"is_impossible": false
},
{
"question": "Case complexities provide three likelihoods of what differing variable that remains the same size? ",
"id": "56e1b8f3e3433e14004230e9",
"answers": [
{
"text": "inputs",
"answer_start": 154
},
{
"text": "inputs",
"answer_start": 154
},
{
"text": "inputs",
"answer_start": 154
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "best, worst and average",
"answer_start": 4
}
],
"question": "What are the three secondary expressions used to represent case complexity? ",
"id": "5ad54c2f5b96ef001a10ac5c",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "best, worst and average",
"answer_start": 4
}
],
"question": "What three different ways are used to measure space complexity?",
"id": "5ad54c2f5b96ef001a10ac5d",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "time",
"answer_start": 91
}
],
"question": "What is one not common example of a critical complexity measure?",
"id": "5ad54c2f5b96ef001a10ac5e",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "inputs",
"answer_start": 154
}
],
"question": "What differing variable remains the same size when providing the four likelihoods of case complexities?",
"id": "5ad54c2f5b96ef001a10ac5f",
"answers": [],
"is_impossible": true
}
],
"context": "The best, worst and average case complexity refer to three different ways of measuring the time complexity (or any other complexity measure) of different inputs of the same size. Since some inputs of size n may be faster to solve than others, we define the following complexities:"
},
{
"qas": [
{
"question": "What provides a solution to a list of integers provided as input that ned to be sorted?",
"id": "56e1ba41cd28a01900c67ae0",
"answers": [
{
"text": "deterministic sorting algorithm quicksort",
"answer_start": 26
},
{
"text": "quicksort",
"answer_start": 58
},
{
"text": "the deterministic sorting algorithm quicksort",
"answer_start": 22
}
],
"is_impossible": false
},
{
"question": "When extensive time is required to sort integers, this represents what case complexity?",
"id": "56e1ba41cd28a01900c67ae1",
"answers": [
{
"text": "worst-case",
"answer_start": 155
},
{
"text": "worst",
"answer_start": 155
},
{
"text": "worst-case",
"answer_start": 155
}
],
"is_impossible": false
},
{
"question": "What is the expression used to denote a worst case complexity as expressed by time taken?",
"id": "56e1ba41cd28a01900c67ae2",
"answers": [
{
"text": "O(n2)",
"answer_start": 251
},
{
"text": "O(n2)",
"answer_start": 251
},
{
"text": "O(n2)",
"answer_start": 251
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "deterministic sorting algorithm quicksort",
"answer_start": 26
}
],
"question": "What does not solve the problem of sorting a list of integers that is given as the input?",
"id": "5ad54d625b96ef001a10ac64",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "solves the problem of sorting a list of integers that is given as the input.",
"answer_start": 74
}
],
"question": "What does the deterministic parting algorithm quicksort do?",
"id": "5ad54d625b96ef001a10ac65",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "worst-case",
"answer_start": 155
}
],
"question": "What case complexity is represented when limited time is required to sort integers?",
"id": "5ad54d625b96ef001a10ac66",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "O(n log n)",
"answer_start": 392
}
],
"question": "What is the expression not used to denote worst case complexity as expressed by time taken?",
"id": "5ad54d625b96ef001a10ac67",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "best case",
"answer_start": 408
}
],
"question": "What case complexity is represented when each pivoting divides the list in thirds, also needing O(n log n) time?",
"id": "5ad54d625b96ef001a10ac68",
"answers": [],
"is_impossible": true
}
],
"context": "For example, consider the deterministic sorting algorithm quicksort. This solves the problem of sorting a list of integers that is given as the input. The worst-case is when the input is sorted or sorted in reverse order, and the algorithm takes time O(n2) for this case. If we assume that all possible permutations of the input list are equally likely, the average time taken for sorting is O(n log n). The best case occurs when each pivoting divides the list in half, also needing O(n log n) time."
},
{
"qas": [
{
"question": "Classification of resources is contingent on determining the upper and lower bounds of minimum time required by what? ",
"id": "56e1bc3ae3433e1400423104",
"answers": [
{
"text": "the most efficient algorithm",
"answer_start": 178
},
{
"text": "the most efficient algorithm",
"answer_start": 178
},
{
"text": "the most efficient algorithm solving a given problem",
"answer_start": 178
}
],
"is_impossible": false
},
{
"question": "The analysis of a specific algorithm is typically assigned to what field of computational science?",
"id": "56e1bc3ae3433e1400423105",
"answers": [
{
"text": "analysis of algorithms",
"answer_start": 399
},
{
"text": "analysis of algorithms",
"answer_start": 399
},
{
"text": "analysis of algorithms",
"answer_start": 399
}
],
"is_impossible": false
},
{
"question": "Which bound of time is more difficult to establish?",
"id": "56e1bc3ae3433e1400423106",
"answers": [
{
"text": "lower bounds",
"answer_start": 123
},
{
"text": "lower",
"answer_start": 597
},
{
"text": "lower bounds",
"answer_start": 597
}
],
"is_impossible": false
},
{
"question": "A specific algorithm demonstrating T(n) represents what measure of time complexity?",
"id": "56e1bc3ae3433e1400423107",
"answers": [
{
"text": "upper bound",
"answer_start": 434
},
{
"text": "upper and lower bounds",
"answer_start": 113
},
{
"text": "upper bound",
"answer_start": 434
}
],
"is_impossible": false
},
{
"question": "What is the colloquial phrase used to convey the continuum of algorithms with unlimited availability irrespective of time? ",
"id": "56e1bc3ae3433e1400423108",
"answers": [
{
"text": "all possible algorithms",
"answer_start": 676
},
{
"text": "all possible algorithms",
"answer_start": 740
},
{
"text": "all possible algorithms",
"answer_start": 740
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "proving upper and lower bounds on the minimum amount of time required by the most efficient algorithm solving a given problem.",
"answer_start": 105
}
],
"question": "How does one note classify the computation time (or similar resources)?",
"id": "5ad54e7c5b96ef001a10ac76",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "complexity of an algorithm",
"answer_start": 236
}
],
"question": "What is usually taken as the best case complexity, unless specified otherwise?",
"id": "5ad54e7c5b96ef001a10ac77",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Analyzing a particular algorithm",
"answer_start": 341
}
],
"question": "What does not fall under the field of analysis of algorithms>",
"id": "5ad54e7c5b96ef001a10ac78",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "To show an upper bound T(n) on the time complexity of a problem",
"answer_start": 423
}
],
"question": "When does one not need to show only that there is a particular algorithm running time at mons T(nO?",
"id": "5ad54e7c5b96ef001a10ac79",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "since lower bounds make a statement about all possible algorithms that solve a given problem",
"answer_start": 634
}
],
"question": "What is easy about proving lower bounds?",
"id": "5ad54e7c5b96ef001a10ac7a",
"answers": [],
"is_impossible": true
}
],
"context": "To classify the computation time (or similar resources, such as space consumption), one is interested in proving upper and lower bounds on the minimum amount of time required by the most efficient algorithm solving a given problem. The complexity of an algorithm is usually taken to be its worst-case complexity, unless specified otherwise. Analyzing a particular algorithm falls under the field of analysis of algorithms. To show an upper bound T(n) on the time complexity of a problem, one needs to show only that there is a particular algorithm with running time at most T(n). However, proving lower bounds is much more difficult, since lower bounds make a statement about all possible algorithms that solve a given problem. The phrase \"all possible algorithms\" includes not just the algorithms known today, but any algorithm that might be discovered in the future. To show a lower bound of T(n) for a problem requires showing that no algorithm can have time complexity lower than T(n)."
},
{
"qas": [
{
"question": "What expression is generally used to convey upper or lower bounds?",
"id": "56e1bd4acd28a01900c67afc",
"answers": [
{
"text": "big O notation",
"answer_start": 52
},
{
"text": "big O notation",
"answer_start": 52
},
{
"text": "big O notation",
"answer_start": 52
}
],
"is_impossible": false
},
{
"question": "What does a big O notation hide?",
"id": "56e1bd4acd28a01900c67afd",
"answers": [
{
"text": "constant factors and smaller terms",
"answer_start": 80
},
{
"text": "constant factors and smaller terms",
"answer_start": 80
},
{
"text": "constant factors and smaller terms",
"answer_start": 80
}
],
"is_impossible": false
},
{
"question": "How would one write T(n) = 7n2 + 15n + 40 in big O notation? ",
"id": "56e1bd4acd28a01900c67afe",
"answers": [
{
"text": "T(n) = O(n2)",
"answer_start": 281
},
{
"text": "T(n) = O(n2)",
"answer_start": 281
},
{
"text": "T(n) = O(n2)",
"answer_start": 281
}
],
"is_impossible": false
},
{
"question": "Big O notation provides autonomy to upper and lower bounds with relationship to what? ",
"id": "56e1bd4acd28a01900c67aff",
"answers": [
{
"text": "the computational model",
"answer_start": 177
},
{
"text": "specific details of the computational model used",
"answer_start": 157
},
{
"text": "the specific details of the computational model used",
"answer_start": 153
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "Upper and lower bounds",
"answer_start": 0
}
],
"question": "What is usually not stated using the big O notation?",
"id": "5ad54f775b96ef001a10ac88",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "big O notation",
"answer_start": 52
}
],
"question": "What does not hide constant factors or smaller terms?",
"id": "5ad54f775b96ef001a10ac89",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "big O notation",
"answer_start": 52
}
],
"question": "What makes the bounds dependent of the specific details of the computational model?",
"id": "5ad54f775b96ef001a10ac8a",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "T(n) = O(n2)",
"answer_start": 281
}
],
"question": "How would one abbreviate T(n)=8n2 + 16n = 40 in big O notatation?",
"id": "5ad54f775b96ef001a10ac8b",
"answers": [],
"is_impossible": true
}
],
"context": "Upper and lower bounds are usually stated using the big O notation, which hides constant factors and smaller terms. This makes the bounds independent of the specific details of the computational model used. For instance, if T(n) = 7n2 + 15n + 40, in big O notation one would write T(n) = O(n2)."
},
{
"qas": [
{
"question": "What has complicated definitions that prevent classification into a framework?",
"id": "56e1c0f6cd28a01900c67b2c",
"answers": [
{
"text": "complexity classes",
"answer_start": 16
},
{
"text": "complexity classes",
"answer_start": 16
},
{
"text": "some complexity classes",
"answer_start": 11
}
],
"is_impossible": false
},
{
"question": "Complexity classes are generally classified into what?",
"id": "56e1c0f6cd28a01900c67b2d",
"answers": [
{
"text": "framework",
"answer_start": 90
},
{
"text": "framework",
"answer_start": 90
},
{
"text": "framework",
"answer_start": 90
}
],
"is_impossible": false
},
{
"question": "Difficulty in establishing a framework for complexity classes can be caused by what variable?",
"id": "56e1c0f6cd28a01900c67b2e",
"answers": [
{
"text": "complicated definitions",
"answer_start": 40
},
{
"text": "complicated definitions",
"answer_start": 40
},
{
"text": "definitions",
"answer_start": 52
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "complicated definitions",
"answer_start": 40
}
],
"question": "What fits the framework of complexity classes?",
"id": "5ad5501f5b96ef001a10ac90",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "complexity classes",
"answer_start": 16
}
],
"question": "What has uncomplicated definitions that prevent classification into a framework?",
"id": "5ad5501f5b96ef001a10ac91",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "framework",
"answer_start": 90
}
],
"question": "What are complexity classes generally not classified into?",
"id": "5ad5501f5b96ef001a10ac92",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "complicated definitions",
"answer_start": 40
}
],
"question": "What variable is easy to establish in a framework for complexity classes?",
"id": "5ad5501f5b96ef001a10ac93",
"answers": [],
"is_impossible": true
}
],
"context": "Of course, some complexity classes have complicated definitions that do not fit into this framework. Thus, a typical complexity class has a definition like the following:"
},
{
"qas": [
{
"question": "Concrete bounding of computation time frequently produces complexity classes contingent upon what?",
"id": "56e1c2eee3433e1400423134",
"answers": [
{
"text": "chosen machine model",
"answer_start": 122
},
{
"text": "the chosen machine model",
"answer_start": 118
},
{
"text": "the chosen machine model",
"answer_start": 118
}
],
"is_impossible": false
},
{
"question": "A multi-tape Turing machine requires what type of time for a solution?",
"id": "56e1c2eee3433e1400423135",
"answers": [
{
"text": "linear time",
"answer_start": 218
},
{
"text": "linear",
"answer_start": 218
},
{
"text": "linear",
"answer_start": 218
}
],
"is_impossible": false
},
{
"question": "A language solved in quadratic time implies the use of what type of Turing machine?",
"id": "56e1c2eee3433e1400423136",
"answers": [
{
"text": "single-tape Turing machines",
"answer_start": 318
},
{
"text": "single-tape",
"answer_start": 318
},
{
"text": "single-tape",
"answer_start": 318
}
],
"is_impossible": false
},
{
"question": "What thesis specifies that a polynomial relationship exists within time complexities in a computational model? ",
"id": "56e1c2eee3433e1400423137",
"answers": [
{
"text": "Cobham-Edmonds thesis",
"answer_start": 398
},
{
"text": "Cobham-Edmonds",
"answer_start": 398
},
{
"text": "Cobham-Edmonds thesis",
"answer_start": 398
}
],
"is_impossible": false
},
{
"question": "Decision problems capable of being solved by a deterministic Turing machine while maintaining adherence to polynomial time belong to what class?",
"id": "56e1c2eee3433e1400423138",
"answers": [
{
"text": "complexity class P",
"answer_start": 597
},
{
"text": "P",
"answer_start": 614
},
{
"text": "complexity class P",
"answer_start": 597
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "bounding the computation time",
"answer_start": 4
}
],
"question": "What does not often yield complexity classes that depend on the chosen machine model?",
"id": "5ad55ee35b96ef001a10ace4",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "the chosen machine model",
"answer_start": 118
}
],
"question": "What does not frequently produce complexity classes that have concrete bounding of computation time?",
"id": "5ad55ee35b96ef001a10ace5",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "the language {xx | x",
"answer_start": 158
}
],
"question": "What can not be solved in linear time on multi-tape Turing machine?",
"id": "5ad55ee35b96ef001a10ace6",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "the language {xx",
"answer_start": 158
}
],
"question": "What is not a binary string?",
"id": "5ad55ee35b96ef001a10ace7",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Cobham-Edmonds thesis",
"answer_start": 398
}
],
"question": "What thesis specifies that a trinomial relationship exists within time complexities in a computational model?",
"id": "5ad55ee35b96ef001a10ace8",
"answers": [],
"is_impossible": true
}
],
"context": "But bounding the computation time above by some concrete function f(n) often yields complexity classes that depend on the chosen machine model. For instance, the language {xx | x is any binary string} can be solved in linear time on a multi-tape Turing machine, but necessarily requires quadratic time in the model of single-tape Turing machines. If we allow polynomial variations in running time, Cobham-Edmonds thesis states that \"the time complexities in any two reasonable and general models of computation are polynomially related\" (Goldreich 2008, Chapter 1.2). This forms the basis for the complexity class P, which is the set of decision problems solvable by a deterministic Turing machine within polynomial time. The corresponding set of function problems is FP."
},
{
"qas": [
{
"question": "What are two examples of measurements are bound within algorithms to establish complexity classes?",
"id": "56e1c3e1e3433e1400423148",
"answers": [
{
"text": "time or space",
"answer_start": 65
},
{
"text": "time or space",
"answer_start": 65
},
{
"text": "time or space",
"answer_start": 65
}
],
"is_impossible": false
},
{
"question": "What function is used by algorithms to define measurements like time or space?",
"id": "56e1c3e1e3433e1400423149",
"answers": [
{
"text": "bounding",
"answer_start": 52
},
{
"text": "bounding",
"answer_start": 52
},
{
"text": "bounding",
"answer_start": 52
}
],
"is_impossible": false
},
{
"question": "Bounding of time and space or similar measurements is often used by algorithms to define what?",
"id": "56e1c3e1e3433e140042314a",
"answers": [
{
"text": "complexity classes",
"answer_start": 15
},
{
"text": "complexity classes",
"answer_start": 15
},
{
"text": "complexity classes",
"answer_start": 15
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "Many important complexity classes",
"answer_start": 0
}
],
"question": "What cannot be defined by bounding the time or space used the the algorithm?",
"id": "5ad55fe75b96ef001a10ad0c",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "time or space",
"answer_start": 65
}
],
"question": "What are three examples of measurement that are bound within algorithms to establish complexity classes?",
"id": "5ad55fe75b96ef001a10ad0d",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "bounding",
"answer_start": 52
}
],
"question": "What function is used by algorithms to define measurements like time and numbers?",
"id": "5ad55fe75b96ef001a10ad0e",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "complexity classes",
"answer_start": 15
}
],
"question": "What is often used by algorithms to measure bounding of space and atmosphere measurements?",
"id": "5ad55fe75b96ef001a10ad0f",
"answers": [],
"is_impossible": true
}
],
"context": "Many important complexity classes can be defined by bounding the time or space used by the algorithm. Some important complexity classes of decision problems defined in this manner are the following:"
},
{
"qas": [
{
"question": "What are three examples of complexity classes associated with definitions established by probabilistic Turing machines?",
"id": "56e1c4fce3433e140042314e",
"answers": [
{
"text": "BPP, ZPP and RP",
"answer_start": 43
},
{
"text": "BPP, ZPP and RP",
"answer_start": 43
},
{
"text": "BPP, ZPP and RP",
"answer_start": 43
}
],
"is_impossible": false
},
{
"question": "AC and NC are complexity classes typically associated with what type of circuit?",
"id": "56e1c4fce3433e140042314f",
"answers": [
{
"text": "Boolean",
"answer_start": 150
},
{
"text": "Boolean",
"answer_start": 150
},
{
"text": "Boolean circuits;",
"answer_start": 150
}
],
"is_impossible": false
},
{
"question": "BQP and QMA are examples of complexity classes most commonly associated with what type of Turing machine?",
"id": "56e1c4fce3433e1400423150",
"answers": [
{
"text": "quantum",
"answer_start": 209
},
{
"text": "quantum",
"answer_start": 209
},
{
"text": "quantum",
"answer_start": 209
}
],
"is_impossible": false
},
{
"question": "What is the expression used to represent a complexity class of counting problems?",
"id": "56e1c4fce3433e1400423151",
"answers": [
{
"text": "#P",
"answer_start": 234
},
{
"text": "#P",
"answer_start": 234
},
{
"text": "#P",
"answer_start": 234
}
],
"is_impossible": false
},
{
"question": "IP and AM are most commonly defined by what type of proof system?",
"id": "56e1c4fce3433e1400423152",
"answers": [
{
"text": "Interactive",
"answer_start": 357
},
{
"text": "Interactive",
"answer_start": 357
},
{
"text": "Interactive",
"answer_start": 357
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "BPP, ZPP and RP",
"answer_start": 43
}
],
"question": "What are the other four important complexity classes?",
"id": "5ad560b85b96ef001a10ad1e",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "are defined using Boolean circuits",
"answer_start": 132
}
],
"question": "What machine does not define BPP, ZPP, and RP?",
"id": "5ad560b85b96ef001a10ad1f",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "are defined using quantum Turing machines.",
"answer_start": 191
}
],
"question": "What machine does not define BQP or QMA?",
"id": "5ad560b85b96ef001a10ad20",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "#P",
"answer_start": 234
}
],
"question": "What is least important complexity class of counting problems?",
"id": "5ad560b85b96ef001a10ad21",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Interactive proof systems",
"answer_start": 357
}
],
"question": "What system not often define classes like IP and AM/",
"id": "5ad560b85b96ef001a10ad22",
"answers": [],
"is_impossible": true
}
],
"context": "Other important complexity classes include BPP, ZPP and RP, which are defined using probabilistic Turing machines; AC and NC, which are defined using Boolean circuits; and BQP and QMA, which are defined using quantum Turing machines. #P is an important complexity class of counting problems (not decision problems). Classes like IP and AM are defined using Interactive proof systems. ALL is the class of all decision problems."
},
{
"qas": [
{
"question": "What is an example of a measurement within a complexity class that would create a bigger set of problems if the bounds were relaxed?",
"id": "56e1c720e3433e140042316a",
"answers": [
{
"text": "computation time",
"answer_start": 113
},
{
"text": "computation time",
"answer_start": 113
},
{
"text": "computation time",
"answer_start": 113
}
],
"is_impossible": false
},
{
"question": "In what expression can one expect to find DTIME(n)",
"id": "56e1c720e3433e140042316b",
"answers": [
{
"text": "DTIME(n2)",
"answer_start": 220
},
{
"text": "DTIME(n2)",
"answer_start": 220
},
{
"text": "DTIME(n2)",
"answer_start": 220
}
],
"is_impossible": false
},
{
"question": "What theorems are responsible for determining questions of time and space requirements?",
"id": "56e1c720e3433e140042316c",
"answers": [
{
"text": "time and space hierarchy theorems",
"answer_start": 369
},
{
"text": "time and space hierarchy theorems",
"answer_start": 369
},
{
"text": "time and space hierarchy theorems",
"answer_start": 369
}
],
"is_impossible": false
},
{
"question": "Resources are constrained by hierarchy theorems to produce what?",
"id": "56e1c720e3433e140042316d",
"answers": [
{
"text": "a proper hierarchy on the classes defined",
"answer_start": 472
},
{
"text": "a proper hierarchy on the classes",
"answer_start": 472
},
{
"text": "a proper hierarchy",
"answer_start": 472
}
],
"is_impossible": false
},
{
"question": "What kind of statement is made in the effort of establishing the time and space requirements needed to enhance the ultimate number of problems solved?",
"id": "56e1c720e3433e140042316e",
"answers": [
{
"text": "quantitative statements",
"answer_start": 714
},
{
"text": "quantitative",
"answer_start": 714
},
{
"text": "quantitative",
"answer_start": 714
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "computation time",
"answer_start": 113
}
],
"question": "What is not an example of a measurement within a complexity class that would create a bigger set of problems if the bounds were relaxed?",
"id": "5ad561c85b96ef001a10ad3c",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "computation time",
"answer_start": 113
}
],
"question": "What does not define a bigger set of problems?",
"id": "5ad561c85b96ef001a10ad3d",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "DTIME(n2)",
"answer_start": 220
}
],
"question": "What expression does not usually contain DTIME(n)?",
"id": "5ad561c85b96ef001a10ad3e",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "hierarchy theorems",
"answer_start": 433
}
],
"question": "What does not induce a proper hierarchy on the classes defined by constraining the respective resources?",
"id": "5ad561c85b96ef001a10ad3f",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "quantitative statements",
"answer_start": 714
}
],
"question": "What kind of statement is not made in an effort of establishing the time and space requirements needed to enhance the ultimate number of problems solved?",
"id": "5ad561c85b96ef001a10ad40",
"answers": [],
"is_impossible": true
}
],
"context": "For the complexity classes defined in this way, it is desirable to prove that relaxing the requirements on (say) computation time indeed defines a bigger set of problems. In particular, although DTIME(n) is contained in DTIME(n2), it would be interesting to know if the inclusion is strict. For time and space requirements, the answer to such questions is given by the time and space hierarchy theorems respectively. They are called hierarchy theorems because they induce a proper hierarchy on the classes defined by constraining the respective resources. Thus there are pairs of complexity classes such that one is properly included in the other. Having deduced such proper set inclusions, we can proceed to make quantitative statements about how much more additional time or space is needed in order to increase the number of problems that can be solved."
},
{
"qas": [
{
"question": "What is the foundation for separation results within complexity classes?",
"id": "56e1c7e2cd28a01900c67b74",
"answers": [
{
"text": "time and space hierarchy theorems",
"answer_start": 4
},
{
"text": "The time and space hierarchy theorems",
"answer_start": 0
},
{
"text": "time and space hierarchy theorems",
"answer_start": 4
}
],
"is_impossible": false
},
{
"question": "What is responsible for constraining P according to the time hierarchy theorem?",
"id": "56e1c7e2cd28a01900c67b75",
"answers": [
{
"text": "EXPTIME",
"answer_start": 186
},
{
"text": "EXPTIME",
"answer_start": 186
},
{
"text": "EXPTIME",
"answer_start": 186
}
],
"is_impossible": false
},
{
"question": "Within what variable is L constrained according to the space hierarchy theorem?",
"id": "56e1c7e2cd28a01900c67b76",
"answers": [
{
"text": "PSPACE",
"answer_start": 268
},
{
"text": "PSPACE",
"answer_start": 268
},
{
"text": "PSPACE",
"answer_start": 268
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "The time and space hierarchy theorems",
"answer_start": 0
}
],
"question": "What does not form the basis for most separation results of complexity classes?",
"id": "5ad562525b96ef001a10ad50",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "for most separation results of complexity classes.",
"answer_start": 53
}
],
"question": "What does the past time and space hierarchy theorems form the basis of?",
"id": "5ad562525b96ef001a10ad51",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "P",
"answer_start": 159
}
],
"question": "What is not strictly contained in EXPTIME?",
"id": "5ad562525b96ef001a10ad52",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "L",
"answer_start": 241
}
],
"question": "What is not strictly contained in PSPACE?",
"id": "5ad562525b96ef001a10ad53",
"answers": [],
"is_impossible": true
}
],
"context": "The time and space hierarchy theorems form the basis for most separation results of complexity classes. For instance, the time hierarchy theorem tells us that P is strictly contained in EXPTIME, and the space hierarchy theorem tells us that L is strictly contained in PSPACE."
},
{
"qas": [
{
"question": "What concept is frequently used to define complexity classes?",
"id": "56e1c9bfe3433e1400423192",
"answers": [
{
"text": "reduction",
"answer_start": 59
},
{
"text": "a reduction",
"answer_start": 57
},
{
"text": "reduction",
"answer_start": 59
}
],
"is_impossible": false
},
{
"question": "Reduction essentially takes one problem and converts into what?",
"id": "56e1c9bfe3433e1400423193",
"answers": [
{
"text": "another problem",
"answer_start": 122
},
{
"text": "another problem",
"answer_start": 122
},
{
"text": "another problem",
"answer_start": 122
}
],
"is_impossible": false
},
{
"question": "According to reduction, if X and Y can be solved by the same algorithm then X performs what function in relationship to Y?",
"id": "56e1c9bfe3433e1400423194",
"answers": [
{
"text": "reduces",
"answer_start": 350
},
{
"text": "reduces",
"answer_start": 350
},
{
"text": "X reduces to Y",
"answer_start": 348
}
],
"is_impossible": false
},
{
"question": "What are two examples of different types of reduction?",
"id": "56e1c9bfe3433e1400423195",
"answers": [
{
"text": "Karp reductions and Levin reductions",
"answer_start": 469
},
{
"text": "Cook reductions, Karp reductions",
"answer_start": 452
}
],
"is_impossible": false
},
{
"question": "Polynomial time reductions are an example of what?",
"id": "56e1c9bfe3433e1400423196",
"answers": [
{
"text": "the bound on the complexity of reductions",
"answer_start": 511
},
{
"text": "types of reductions",
"answer_start": 389
},
{
"text": "the bound on the complexity of reductions",
"answer_start": 511
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "the concept of a reduction.",
"answer_start": 42
}
],
"question": "What are many complexity classes not defined by?",
"id": "5ad5632f5b96ef001a10ad6c",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Many complexity classes",
"answer_start": 0
}
],
"question": "What is defined by using the theorem of reduction?",
"id": "5ad5632f5b96ef001a10ad6d",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "reduction",
"answer_start": 72
}
],
"question": "What is a transformation of two problems into on three problems?",
"id": "5ad5632f5b96ef001a10ad6e",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "reduction",
"answer_start": 72
}
],
"question": "What captures the formal notion of a problem being at lease as difficult as another problem?",
"id": "5ad5632f5b96ef001a10ad6f",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Cook reductions, Karp reductions and Levin reductions, and the bound on the complexity of reductions, such as polynomial-time reductions or log-space",
"answer_start": 452
}
],
"question": "What are the six types of reductions?",
"id": "5ad5632f5b96ef001a10ad70",
"answers": [],
"is_impossible": true
}
],
"context": "Many complexity classes are defined using the concept of a reduction. A reduction is a transformation of one problem into another problem. It captures the informal notion of a problem being at least as difficult as another problem. For instance, if a problem X can be solved using an algorithm for Y, X is no more difficult than Y, and we say that X reduces to Y. There are many different types of reductions, based on the method of reduction, such as Cook reductions, Karp reductions and Levin reductions, and the bound on the complexity of reductions, such as polynomial-time reductions or log-space reductions."
},
{
"qas": [
{
"question": "What is the most frequently employed type of reduction?",
"id": "56e1cbe2cd28a01900c67bac",
"answers": [
{
"text": "polynomial-time reduction",
"answer_start": 38
},
{
"text": "polynomial-time",
"answer_start": 38
},
{
"text": "polynomial-time reduction",
"answer_start": 38
}
],
"is_impossible": false
},
{
"question": "What equates to a squared integer according to polynomial time reduction?",
"id": "56e1cbe2cd28a01900c67bad",
"answers": [
{
"text": "multiplying two integers",
"answer_start": 207
},
{
"text": "multiplying two integers",
"answer_start": 207
},
{
"text": "multiplying two integers",
"answer_start": 207
}
],
"is_impossible": false
},
{
"question": "What measurement of time is used in polynomial time reduction?",
"id": "56e1cbe2cd28a01900c67bae",
"answers": [
{
"text": "polynomial time",
"answer_start": 109
},
{
"text": "polynomial",
"answer_start": 109
},
{
"text": "polynomial time",
"answer_start": 109
}
],
"is_impossible": false
},
{
"question": "What would need to remain constant in a multiplication algorithm to produce the same outcome whether multiplying or squaring two integers? ",
"id": "56e1cbe2cd28a01900c67baf",
"answers": [
{
"text": "input",
"answer_start": 364
},
{
"text": "input",
"answer_start": 364
},
{
"text": "input",
"answer_start": 364
}
],
"is_impossible": false
},
{
"question": "According to polynomial time reduction squaring can ultimately be logically reduced to what?",
"id": "56e1cbe2cd28a01900c67bb0",
"answers": [
{
"text": "multiplication",
"answer_start": 392
},
{
"text": "multiplication",
"answer_start": 520
},
{
"text": "multiplication",
"answer_start": 520
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "polynomial-time reduction",
"answer_start": 38
}
],
"question": "What is the least used type of reduction?",
"id": "5ad5648b5b96ef001a10ad94",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "the reduction process takes polynomial time.",
"answer_start": 81
}
],
"question": "What is the meaning of polynomial-space reduction?",
"id": "5ad5648b5b96ef001a10ad95",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "to the problem of multiplying two integers.",
"answer_start": 189
}
],
"question": "What can the problem of dividing an integer be reduced to?",
"id": "5ad5648b5b96ef001a10ad96",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "input",
"answer_start": 364
}
],
"question": "What does one not need to remain constant in a multiplication algorithm to produce the same outcome whether multiplying or squaring two integers?",
"id": "5ad5648b5b96ef001a10ad97",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "squaring",
"answer_start": 435
}
],
"question": "What is more difficult that multiplication?",
"id": "5ad5648b5b96ef001a10ad98",
"answers": [],
"is_impossible": true
}
],
"context": "The most commonly used reduction is a polynomial-time reduction. This means that the reduction process takes polynomial time. For example, the problem of squaring an integer can be reduced to the problem of multiplying two integers. This means an algorithm for multiplying two integers can be used to square an integer. Indeed, this can be done by giving the same input to both inputs of the multiplication algorithm. Thus we see that squaring is not more difficult than multiplication, since squaring can be reduced to multiplication."
},
{
"qas": [
{
"question": "The complexity of problems often depends on what?",
"id": "56e1ce08e3433e14004231a4",
"answers": [
{
"text": "the type of reduction being used",
"answer_start": 315
},
{
"text": "the type of reduction being used",
"answer_start": 315
}
],
"is_impossible": false
},
{
"question": "What would create a conflict between a problem X and problem C within the context of reduction? ",
"id": "56e1ce08e3433e14004231a5",
"answers": [
{
"text": "if every problem in C can be reduced to X",
"answer_start": 121
},
{
"text": "problem in C is harder than X",
"answer_start": 172
}
],
"is_impossible": false
},
{
"question": "An algorithm for X which reduces to C would us to do what?",
"id": "56e1ce08e3433e14004231a6",
"answers": [
{
"text": "solve any problem in C",
"answer_start": 241
},
{
"text": "solve any problem in C",
"answer_start": 241
},
{
"text": "solve any problem in C",
"answer_start": 241
}
],
"is_impossible": false
},
{
"question": "A problem set that that is hard for the expression NP can also be stated how?",
"id": "56e1ce08e3433e14004231a8",
"answers": [
{
"text": "NP-hard",
"answer_start": 503
},
{
"text": "NP-hard",
"answer_start": 503
},
{
"text": "NP-hard problems",
"answer_start": 503
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "the type of reduction being used.",
"answer_start": 315
}
],
"question": "What does the complexity of problems not often depend on?",
"id": "5ad565575b96ef001a10adb2",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "if every problem in C can be reduced to X",
"answer_start": 121
}
],
"question": "What would not create a conflict between a problem X and problem C within the context of reduction?",
"id": "5ad565575b96ef001a10adb3",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "no problem",
"answer_start": 169
}
],
"question": "What problem in C is harder than X?",
"id": "5ad565575b96ef001a10adb4",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "NP-hard",
"answer_start": 503
}
],
"question": "How is a problem set that is hard for expression QP be stated?",
"id": "5ad565575b96ef001a10adb5",
"answers": [],
"is_impossible": true
}
],
"context": "This motivates the concept of a problem being hard for a complexity class. A problem X is hard for a class of problems C if every problem in C can be reduced to X. Thus no problem in C is harder than X, since an algorithm for X allows us to solve any problem in C. Of course, the notion of hard problems depends on the type of reduction being used. For complexity classes larger than P, polynomial-time reductions are commonly used. In particular, the set of problems that are hard for NP is the set of NP-hard problems."
},
{
"qas": [
{
"question": "The hardest problems in NP can be analogously written as what class of problems?",
"id": "56e1d9fee3433e14004231cb",
"answers": [
{
"text": "NP-complete",
"answer_start": 244
},
{
"text": "NP-complete",
"answer_start": 244
},
{
"text": "NP-complete",
"answer_start": 244
}
],
"is_impossible": false
},
{
"question": "NP complete problems contain the lowest likelihood of being located in what problem class?",
"id": "56e1d9fee3433e14004231cc",
"answers": [
{
"text": "NP",
"answer_start": 244
},
{
"text": "P",
"answer_start": 370
},
{
"text": "P",
"answer_start": 370
}
],
"is_impossible": false
},
{
"question": "If P = NP is unsolved, and reduction is applied to a known NP-complete problem vis a vis Π2 to Π1, what conclusion can be drawn for Π1?",
"id": "56e1d9fee3433e14004231cd",
"answers": [
{
"text": "there is no known polynomial-time solution",
"answer_start": 513
},
{
"text": "no known polynomial-time solution",
"answer_start": 522
},
{
"text": "there is no known polynomial-time solution",
"answer_start": 513
}
],
"is_impossible": false
},
{
"question": "If polynomial time can be utilized within an NP-complete problem, what does the imply P is equal to?",
"id": "56e1d9fee3433e14004231ce",
"answers": [
{
"text": "NP",
"answer_start": 244
},
{
"text": "NP",
"answer_start": 810
},
{
"text": "NP",
"answer_start": 810
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "then X is said to be complete for C.",
"answer_start": 39
}
],
"question": "What happens if a problem X is in C, and soft for C?",
"id": "5ad566375b96ef001a10adce",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "X",
"answer_start": 92
}
],
"question": "What is the softest problem in C?",
"id": "5ad566375b96ef001a10adcf",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "NP-complete",
"answer_start": 244
}
],
"question": "What is class contains the the least difficult problems in NP?",
"id": "5ad566375b96ef001a10add0",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "the problem P = NP is not solved, being able to reduce a known NP-complete problem, Π2, to another problem, Π1",
"answer_start": 381
}
],
"question": "What would indicate that there is a known polynomial-time solution for Ii1?",
"id": "5ad566375b96ef001a10add1",
"answers": [],
"is_impossible": true
}
],
"context": "If a problem X is in C and hard for C, then X is said to be complete for C. This means that X is the hardest problem in C. (Since many problems could be equally hard, one might say that X is one of the hardest problems in C.) Thus the class of NP-complete problems contains the most difficult problems in NP, in the sense that they are the ones most likely not to be in P. Because the problem P = NP is not solved, being able to reduce a known NP-complete problem, Π2, to another problem, Π1, would indicate that there is no known polynomial-time solution for Π1. This is because a polynomial-time solution to Π1 would yield a polynomial-time solution to Π2. Similarly, because all NP problems can be reduced to the set, finding an NP-complete problem that can be solved in polynomial time would mean that P = NP."
},
{
"qas": [
{
"question": "What complexity class is characterized by a computational tasks and efficient algorithms?",
"id": "56e1dc62cd28a01900c67bca",
"answers": [
{
"text": "P",
"answer_start": 21
},
{
"text": "P",
"answer_start": 21
},
{
"text": "P",
"answer_start": 21
}
],
"is_impossible": false
},
{
"question": "What hypothesis is associated with the complexity class of P viewed as a mathematical abstraction with efficient algorithmic functionality?",
"id": "56e1dc62cd28a01900c67bcb",
"answers": [
{
"text": "Cobham–Edmonds thesis",
"answer_start": 167
},
{
"text": "Cobham–Edmonds thesis",
"answer_start": 167
},
{
"text": "Cobham–Edmonds thesis",
"answer_start": 167
}
],
"is_impossible": false
},
{
"question": "What complexity class is commonly characterized by unknown algorithms to enhance solvability?",
"id": "56e1dc62cd28a01900c67bcc",
"answers": [
{
"text": "NP",
"answer_start": 211
},
{
"text": "NP",
"answer_start": 211
},
{
"text": "NP",
"answer_start": 211
}
],
"is_impossible": false
},
{
"question": "What is an example of a problem that rests within the NP complexity class?",
"id": "56e1dc62cd28a01900c67bcd",
"answers": [
{
"text": "Boolean satisfiability problem",
"answer_start": 361
},
{
"text": "Boolean satisfiability problem",
"answer_start": 361
}
],
"is_impossible": false
},
{
"question": "In what theoretical machine is it confirmed that a problem in P belies membership in the NP class?",
"id": "56e1dc62cd28a01900c67bce",
"answers": [
{
"text": "Turing machines",
"answer_start": 472
},
{
"text": "deterministic Turing machines",
"answer_start": 458
},
{
"text": "deterministic Turing machines",
"answer_start": 458
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "The complexity class P",
"answer_start": 0
}
],
"question": "What is often seen as a scientific abstraction modeling those computational tasks that admit an efficient algorithm?",
"id": "5ad567055b96ef001a10adea",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "The complexity class P is often seen as a mathematical abstraction modeling those computational tasks that admit an efficient algorithm.",
"answer_start": 0
}
],
"question": "What theory is the Cobham-Edward thesis?",
"id": "5ad567055b96ef001a10adeb",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "NP",
"answer_start": 211
}
],
"question": "What complexity class is not commonly characterized by unknown algorithms to enhance solubility?",
"id": "5ad567055b96ef001a10adec",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Boolean satisfiability problem",
"answer_start": 361
}
],
"question": "What is an example of a problem that rests within the NP simplicity class?",
"id": "5ad567055b96ef001a10aded",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Turing machines",
"answer_start": 518
}
],
"question": "What ,theoretical machine did not confirm that a problem in P belies membership in the NX class?",
"id": "5ad567055b96ef001a10adee",
"answers": [],
"is_impossible": true
}
],
"context": "The complexity class P is often seen as a mathematical abstraction modeling those computational tasks that admit an efficient algorithm. This hypothesis is called the Cobham–Edmonds thesis. The complexity class NP, on the other hand, contains many problems that people would like to solve efficiently, but for which no efficient algorithm is known, such as the Boolean satisfiability problem, the Hamiltonian path problem and the vertex cover problem. Since deterministic Turing machines are special non-deterministic Turing machines, it is easily observed that each problem in P is also member of the class NP."
},
{
"qas": [
{
"question": "If P is ultimately proven to be equal tot NP, what effect would this have on the efficiency of problems?",
"id": "56e1ddfce3433e14004231d5",
"answers": [
{
"text": "more efficient solutions",
"answer_start": 227
},
{
"text": "shown to have more efficient solutions",
"answer_start": 213
},
{
"text": "many important problems can be shown to have more efficient solutions",
"answer_start": 182
}
],
"is_impossible": false
},
{
"question": "What is a particular problem in biology that would benefit from determining that P = NP?",
"id": "56e1ddfce3433e14004231d6",
"answers": [
{
"text": "protein structure prediction",
"answer_start": 365
},
{
"text": "protein structure prediction",
"answer_start": 365
},
{
"text": "protein structure prediction",
"answer_start": 365
}
],
"is_impossible": false
},
{
"question": "What is the prize offered for finding a solution to P=NP?",
"id": "56e1ddfce3433e14004231d8",
"answers": [
{
"text": "$1,000,000",
"answer_start": 595
},
{
"text": "US$1,000,000",
"answer_start": 593
},
{
"text": "US$1,000,000",
"answer_start": 593
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "The question of whether P equals NP",
"answer_start": 0
}
],
"question": "What is one of the least important open questions in theoretical computer science?",
"id": "5ad568175b96ef001a10ae10",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "more efficient solutions",
"answer_start": 227
}
],
"question": "What effect would happen if P is ultimately proven to not equal NP ?",
"id": "5ad568175b96ef001a10ae11",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "protein structure prediction",
"answer_start": 365
}
],
"question": "What is a particular problem in chemistry that would benefit from determining that P = NP?",
"id": "5ad568175b96ef001a10ae12",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "The P versus NP problem",
"answer_start": 474
}
],
"question": "What problem was proposed by Clay Mathematics Institute at the Alpha Prize Problems?",
"id": "5ad568175b96ef001a10ae13",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "$1,000,000",
"answer_start": 595
}
],
"question": "What was the prize for finding a solution to P=NP at the the Alpha Prize Problems?",
"id": "5ad568175b96ef001a10ae14",
"answers": [],
"is_impossible": true
}
],
"context": "The question of whether P equals NP is one of the most important open questions in theoretical computer science because of the wide implications of a solution. If the answer is yes, many important problems can be shown to have more efficient solutions. These include various types of integer programming problems in operations research, many problems in logistics, protein structure prediction in biology, and the ability to find formal proofs of pure mathematics theorems. The P versus NP problem is one of the Millennium Prize Problems proposed by the Clay Mathematics Institute. There is a US$1,000,000 prize for resolving the problem."
},
{
"qas": [
{
"question": "Who demonstrated that P= NP implies problems not present in P or NP-complete?",
"id": "56e1ded7cd28a01900c67bd4",
"answers": [
{
"text": "Ladner",
"answer_start": 16
},
{
"text": "Ladner",
"answer_start": 16
},
{
"text": "Ladner",
"answer_start": 16
}
],
"is_impossible": false
},
{
"question": "What is the name for a problem that meets Ladner's assertion?",
"id": "56e1ded7cd28a01900c67bd5",
"answers": [
{
"text": "NP-intermediate problems",
"answer_start": 134
},
{
"text": "NP-intermediate problems",
"answer_start": 134
},
{
"text": "NP-intermediate",
"answer_start": 134
}
],
"is_impossible": false
},
{
"question": "What is an example of an NP-intermediate problem not known to exist in P or NP-complete? ",
"id": "56e1ded7cd28a01900c67bd6",
"answers": [
{
"text": "graph isomorphism problem",
"answer_start": 164
},
{
"text": "the discrete logarithm problem",
"answer_start": 191
},
{
"text": "graph isomorphism problem, the discrete logarithm problem and the integer factorization problem",
"answer_start": 164
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "Ladner",
"answer_start": 16
}
],
"question": "Who showed that if P=NQ then there exists problems in NQ that are neither P nor NQ-complete?",
"id": "5ad568d35b96ef001a10ae1a",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "NP-intermediate problems",
"answer_start": 134
}
],
"question": "What is the name a a problem that meets Ladder's assertion?",
"id": "5ad568d35b96ef001a10ae1b",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "graph isomorphism problem",
"answer_start": 164
}
],
"question": "What is not example of an NP-intermediate problem not known to exist in P or NP-complete?",
"id": "5ad568d35b96ef001a10ae1c",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "The graph isomorphism problem, the discrete logarithm problem and the integer factorization problem",
"answer_start": 160
}
],
"question": "What are four examples of problems believed to be NP=intermediate?",
"id": "5ad568d35b96ef001a10ae1d",
"answers": [],
"is_impossible": true
}
],
"context": "It was shown by Ladner that if P ≠ NP then there exist problems in NP that are neither in P nor NP-complete. Such problems are called NP-intermediate problems. The graph isomorphism problem, the discrete logarithm problem and the integer factorization problem are examples of problems believed to be NP-intermediate. They are some of the very few NP problems not known to be in P or to be NP-complete."
},
{
"qas": [
{
"question": "What is the problem attributed to defining if two finite graphs are isomorphic?",
"id": "56e1e9dfe3433e14004231fc",
"answers": [
{
"text": "The graph isomorphism problem",
"answer_start": 0
},
{
"text": "graph isomorphism",
"answer_start": 4
},
{
"text": "The graph isomorphism problem",
"answer_start": 0
}
],
"is_impossible": false
},
{
"question": "What class is most commonly not ascribed to the graph isomorphism problem in spite of definitive determination?",
"id": "56e1e9dfe3433e14004231fd",
"answers": [
{
"text": "NP-complete",
"answer_start": 217
},
{
"text": "NP-complete",
"answer_start": 327
},
{
"text": "NP-complete",
"answer_start": 327
}
],
"is_impossible": false
},
{
"question": "What finite hierarchy implies that the graph isomorphism problem is NP-complete? ",
"id": "56e1e9dfe3433e14004231fe",
"answers": [
{
"text": "polynomial time hierarchy",
"answer_start": 381
},
{
"text": "polynomial time",
"answer_start": 381
},
{
"text": "polynomial time hierarchy",
"answer_start": 381
}
],
"is_impossible": false
},
{
"question": "To what level would the polynomial time hierarchy collapse if graph isomorphism is NP-complete?",
"id": "56e1e9dfe3433e14004231ff",
"answers": [
{
"text": "second level",
"answer_start": 424
},
{
"text": "second",
"answer_start": 424
},
{
"text": "second",
"answer_start": 424
}
],
"is_impossible": false
},
{
"question": "Who are commonly associated with the algorithm typically considered the most effective with respect to finite polynomial hierarchy and graph isomorphism?",
"id": "56e1e9dfe3433e1400423200",
"answers": [
{
"text": "Laszlo Babai and Eugene Luks",
"answer_start": 637
},
{
"text": "Babai and Eugene Luks",
"answer_start": 644
},
{
"text": "Laszlo Babai and Eugene Luks",
"answer_start": 637
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "the computational problem of determining whether two finite graphs are isomorphic.",
"answer_start": 33
}
],
"question": "What is the graph isolation problem? ",
"id": "5ad569c05b96ef001a10ae36",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "The graph isomorphism problem",
"answer_start": 0
}
],
"question": "What is the problem attributed to defining if three finite graphs are isomorphic?",
"id": "5ad569c05b96ef001a10ae37",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "whether the graph isomorphism problem is in P, NP-complete, or NP-intermediate.",
"answer_start": 170
}
],
"question": "What is an important solved problem in complexity theory?",
"id": "5ad569c05b96ef001a10ae38",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "polynomial hierarchy",
"answer_start": 475
}
],
"question": "What infinite hierarchy implies that the graph isomorphism problem s NQ-complete?",
"id": "5ad569c05b96ef001a10ae39",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "second level",
"answer_start": 424
}
],
"question": "What would the polynomial hierarchy collapse if graph isomorphism is NQ-complete?",
"id": "5ad569c05b96ef001a10ae3a",
"answers": [],
"is_impossible": true
}
],
"context": "The graph isomorphism problem is the computational problem of determining whether two finite graphs are isomorphic. An important unsolved problem in complexity theory is whether the graph isomorphism problem is in P, NP-complete, or NP-intermediate. The answer is not known, but it is believed that the problem is at least not NP-complete. If graph isomorphism is NP-complete, the polynomial time hierarchy collapses to its second level. Since it is widely believed that the polynomial hierarchy does not collapse to any finite level, it is believed that graph isomorphism is not NP-complete. The best algorithm for this problem, due to Laszlo Babai and Eugene Luks has run time 2O(√(n log(n))) for graphs with n vertices."
},
{
"qas": [
{
"question": "What computational problem is commonly associated with prime factorization?",
"id": "56e1ec83cd28a01900c67c0a",
"answers": [
{
"text": "The integer factorization problem",
"answer_start": 0
},
{
"text": "integer factorization",
"answer_start": 4
},
{
"text": "integer factorization problem",
"answer_start": 4
}
],
"is_impossible": false
},
{
"question": "The integer factorization problem essentially seeks to determine if the value of of an input is less than what variable? ",
"id": "56e1ec83cd28a01900c67c0b",
"answers": [
{
"text": "k",
"answer_start": 224
},
{
"text": "k",
"answer_start": 224
},
{
"text": "k",
"answer_start": 224
}
],
"is_impossible": false
},
{
"question": "That there currently exists no known integer factorization problem underpins what commonly used system?",
"id": "56e1ec83cd28a01900c67c0c",
"answers": [
{
"text": "modern cryptographic systems",
"answer_start": 323
},
{
"text": "modern cryptographic systems",
"answer_start": 323
},
{
"text": "RSA algorithm",
"answer_start": 365
}
],
"is_impossible": false
},
{
"question": "What is the most well-known algorithm associated with the integer factorization problem?",
"id": "56e1ec83cd28a01900c67c0e",
"answers": [
{
"text": "the general number field sieve",
"answer_start": 641
},
{
"text": "RSA",
"answer_start": 365
},
{
"text": "general number field sieve",
"answer_start": 645
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "the computational problem of determining the prime factorization of a given integer.",
"answer_start": 37
}
],
"question": "What is the integer practice problem?",
"id": "5ad56aea5b96ef001a10ae48",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "The integer factorization problem",
"answer_start": 0
}
],
"question": "What computational problem is not commonly associated with prime factorization?",
"id": "5ad56aea5b96ef001a10ae49",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "The integer factorization",
"answer_start": 0
}
],
"question": "What problem is phrased on deciding whether the input has a factor more than k?",
"id": "5ad56aea5b96ef001a10ae4a",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "If the problem is NP-complete",
"answer_start": 464
}
],
"question": "What problem would have polynomial time hierarchy that would collapse to its second level?",
"id": "5ad56aea5b96ef001a10ae4b",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "general number field sieve",
"answer_start": 645
}
],
"question": "What is the least well known algorithm associated with the the integer factorization problem?",
"id": "5ad56aea5b96ef001a10ae4c",
"answers": [],
"is_impossible": true
}
],
"context": "The integer factorization problem is the computational problem of determining the prime factorization of a given integer. Phrased as a decision problem, it is the problem of deciding whether the input has a factor less than k. No efficient integer factorization algorithm is known, and this fact forms the basis of several modern cryptographic systems, such as the RSA algorithm. The integer factorization problem is in NP and in co-NP (and even in UP and co-UP). If the problem is NP-complete, the polynomial time hierarchy will collapse to its first level (i.e., NP will equal co-NP). The best known algorithm for integer factorization is the general number field sieve, which takes time O(e(64/9)1/3(n.log 2)1/3(log (n.log 2))2/3) to factor an n-bit integer. However, the best known quantum algorithm for this problem, Shor's algorithm, does run in polynomial time. Unfortunately, this fact doesn't say much about where the problem lies with respect to non-quantum complexity classes."
},
{
"qas": [
{
"question": "What is the unproven assumption generally ascribed to the value of complexity classes?",
"id": "56e1ee4de3433e1400423210",
"answers": [
{
"text": "suspected to be unequal",
"answer_start": 34
},
{
"text": "unequal",
"answer_start": 50
},
{
"text": "Many known complexity classes are suspected to be unequal",
"answer_start": 0
}
],
"is_impossible": false
},
{
"question": "What is an expression that can be used to illustrate the suspected inequality of complexity classes?",
"id": "56e1ee4de3433e1400423211",
"answers": [
{
"text": "P ⊆ NP ⊆ PP ⊆ PSPACE",
"answer_start": 102
},
{
"text": "P ⊆ NP ⊆ PP ⊆ PSPACE",
"answer_start": 102
},
{
"text": "P ⊆ NP ⊆ PP ⊆ PSPACE",
"answer_start": 102
}
],
"is_impossible": false
},
{
"question": "Where can the complexity classes RP, BPP, PP, BQP, MA, and PH be located?",
"id": "56e1ee4de3433e1400423212",
"answers": [
{
"text": "between P and PSPACE",
"answer_start": 269
},
{
"text": "between P and PSPACE",
"answer_start": 269
},
{
"text": "between P and PSPACE",
"answer_start": 269
}
],
"is_impossible": false
},
{
"question": "What evidence between and among complexity classes would signify a theoretical watershed for complexity theory?",
"id": "56e1ee4de3433e1400423214",
"answers": [
{
"text": "Proving that any of these classes are unequal",
"answer_start": 403
},
{
"text": "Proving that any of these classes are unequal",
"answer_start": 403
},
{
"text": "Proving that any of these classes are unequal",
"answer_start": 403
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "suspected to be unequal",
"answer_start": 34
}
],
"question": "What is the proven assumption generally ascribed to the value of complexity classes?",
"id": "5ad56bcd5b96ef001a10ae62",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "P ⊆ NP ⊆ PP ⊆ PSPACE",
"answer_start": 102
}
],
"question": "What is an expression that caan be used to illustrate the suspected in equality of complexity classes?",
"id": "5ad56bcd5b96ef001a10ae63",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "between P and PSPACE",
"answer_start": 269
}
],
"question": "Where can complexity classes RPP, BPP, PPP, BQP, MA, and PH be located?",
"id": "5ad56bcd5b96ef001a10ae64",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "it is possible that all these complexity classes collapse to one class",
"answer_start": 331
}
],
"question": "What is impossible for the complexity classes RP, BPP, PP, BQP, MA, and PH?",
"id": "5ad56bcd5b96ef001a10ae65",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Proving that any of these classes are unequal",
"answer_start": 403
}
],
"question": "What would not be a major breakthrough in complexity theory?",
"id": "5ad56bcd5b96ef001a10ae66",
"answers": [],
"is_impossible": true
}
],
"context": "Many known complexity classes are suspected to be unequal, but this has not been proved. For instance P ⊆ NP ⊆ PP ⊆ PSPACE, but it is possible that P = PSPACE. If P is not equal to NP, then P is not equal to PSPACE either. Since there are many known complexity classes between P and PSPACE, such as RP, BPP, PP, BQP, MA, PH, etc., it is possible that all these complexity classes collapse to one class. Proving that any of these classes are unequal would be a major breakthrough in complexity theory."
},
{
"qas": [
{
"question": "In what complexity class do complement problems of NP problems exist?",
"id": "56e1efa0e3433e140042321a",
"answers": [
{
"text": "co-NP",
"answer_start": 22
},
{
"text": "co-NP",
"answer_start": 22
},
{
"text": "co-NP",
"answer_start": 22
}
],
"is_impossible": false
},
{
"question": "How do the yes/no answers of a complement problem of NP appear?",
"id": "56e1efa0e3433e140042321b",
"answers": [
{
"text": "reversed",
"answer_start": 115
},
{
"text": "reversed",
"answer_start": 115
},
{
"text": "reversed",
"answer_start": 115
}
],
"is_impossible": false
},
{
"question": "What is commonly believed to be the value relationship between P and co-NP",
"id": "56e1efa0e3433e140042321c",
"answers": [
{
"text": "not equal",
"answer_start": 167
},
{
"text": "not equal",
"answer_start": 303
},
{
"text": "not equal",
"answer_start": 167
}
],
"is_impossible": false
},
{
"question": "What implication can be derived for P and NP if P and co-NP are established to be unequal?",
"id": "56e1efa0e3433e140042321d",
"answers": [
{
"text": "P is not equal to NP",
"answer_start": 298
},
{
"text": "not equal",
"answer_start": 303
},
{
"text": "P is not equal to NP",
"answer_start": 298
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "co-NP",
"answer_start": 22
}
],
"question": "What complexity class do incompatible problems of NP problems exist?",
"id": "5ad56c6b5b96ef001a10ae6c",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "reversed",
"answer_start": 115
}
],
"question": "How do the yes/no answers of an incompatible problem of of APPEAR?",
"id": "5ad56c6b5b96ef001a10ae6d",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "not equal",
"answer_start": 303
}
],
"question": "What is not commonly believed to be the value relationship between P and co-NP?",
"id": "5ad56c6b5b96ef001a10ae6e",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "P is not equal to NP.",
"answer_start": 298
}
],
"question": "What implication can not be derived for P and NP is P and co-NP are established to be unequal?",
"id": "5ad56c6b5b96ef001a10ae6f",
"answers": [],
"is_impossible": true
}
],
"context": "Along the same lines, co-NP is the class containing the complement problems (i.e. problems with the yes/no answers reversed) of NP problems. It is believed that NP is not equal to co-NP; however, it has not yet been proven. It has been shown that if these two complexity classes are not equal then P is not equal to NP."
},
{
"qas": [
{
"question": "What variable is associated with all problems solved within logarithmic space?",
"id": "56e1f10ee3433e1400423222",
"answers": [
{
"text": "L",
"answer_start": 30
},
{
"text": "L",
"answer_start": 30
},
{
"text": "L",
"answer_start": 30
}
],
"is_impossible": false
},
{
"question": "Though unkown, what are the most commonly ascribed attributes of L in relation to P",
"id": "56e1f10ee3433e1400423223",
"answers": [
{
"text": "strictly contained in P or equal to P",
"answer_start": 101
},
{
"text": "contained in P or equal to P.",
"answer_start": 110
},
{
"text": "strictly contained in P or equal to P",
"answer_start": 101
}
],
"is_impossible": false
},
{
"question": "What lies between L and P that prevents a definitive determination of the relationship between L and P?",
"id": "56e1f10ee3433e1400423224",
"answers": [
{
"text": "complexity classes",
"answer_start": 162
},
{
"text": "many complexity classes",
"answer_start": 157
},
{
"text": "many complexity classes",
"answer_start": 157
}
],
"is_impossible": false
},
{
"question": "What are two complexity classes between L and P?",
"id": "56e1f10ee3433e1400423225",
"answers": [
{
"text": "NL and NC",
"answer_start": 206
},
{
"text": "NL and NC",
"answer_start": 206
},
{
"text": "NL and NC",
"answer_start": 206
}
],
"is_impossible": false
},
{
"question": "What is unknown about the complexity classes between L and P that further prevents determining the value relationship between L and P?",
"id": "56e1f10ee3433e1400423226",
"answers": [
{
"text": "if they are distinct or equal classes",
"answer_start": 237
},
{
"text": "if they are distinct or equal classes",
"answer_start": 237
},
{
"text": "if they are distinct or equal classes",
"answer_start": 237
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "L",
"answer_start": 30
}
],
"question": "What variable is not associated with all problems solved within logarithmic space?",
"id": "5ad56d3e5b96ef001a10ae84",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "strictly contained in P or equal to P.",
"answer_start": 101
}
],
"question": "What are the least commonly ascribed attributes of L in relation to P?",
"id": "5ad56d3e5b96ef001a10ae85",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "complexity classes",
"answer_start": 162
}
],
"question": "What does not lie between L and P that allows a definitive determination of the relationship between L and P?",
"id": "5ad56d3e5b96ef001a10ae86",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "NL and NC",
"answer_start": 206
}
],
"question": "What are three complexity classes between L and P?",
"id": "5ad56d3e5b96ef001a10ae87",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "if they are distinct or equal classes.",
"answer_start": 237
}
],
"question": "What is known about the complexity between L and P that prevents determining the value between L and P?",
"id": "5ad56d3e5b96ef001a10ae88",
"answers": [],
"is_impossible": true
}
],
"context": "Similarly, it is not known if L (the set of all problems that can be solved in logarithmic space) is strictly contained in P or equal to P. Again, there are many complexity classes between the two, such as NL and NC, and it is not known if they are distinct or equal classes."
},
{
"qas": [
{
"question": "Problems capable of theoretical solutions but consuming unreasonable time in practical application are known as what?",
"id": "56e1fc57e3433e140042322c",
"answers": [
{
"text": "intractable problems",
"answer_start": 158
},
{
"text": "intractable problems",
"answer_start": 158
},
{
"text": "intractable",
"answer_start": 158
},
{
"text": "intractable",
"answer_start": 158
}
],
"is_impossible": false
},
{
"question": "Intractable problems lacking polynomial time solutions necessarily negate the practical efficacy of what type of algorithm?",
"id": "56e1fc57e3433e140042322f",
"answers": [
{
"text": "exponential-time algorithms",
"answer_start": 673
},
{
"text": "exponential-time",
"answer_start": 673
},
{
"text": "exponential-time algorithms",
"answer_start": 673
},
{
"text": "exponential-time algorithms",
"answer_start": 673
}
],
"is_impossible": false
},
{
"question": "If NP is not equal to P, viewed through this lens, what type of problems can also be considered intractable?",
"id": "56e1fc57e3433e1400423230",
"answers": [
{
"text": "NP-complete problems",
"answer_start": 605
},
{
"text": "NP-complete",
"answer_start": 605
},
{
"text": "NP-complete",
"answer_start": 605
},
{
"text": "NP-complete",
"answer_start": 605
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "intractable problems",
"answer_start": 158
}
],
"question": "What are problems that cannot be solved in theory, but which in practice take too long for their solutions to be useful?",
"id": "5ad56e5c5b96ef001a10ae9e",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "intractable",
"answer_start": 268
}
],
"question": "When are problems that have polynomial-tome solutions in complexity theory?",
"id": "5ad56e5c5b96ef001a10ae9f",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "the Cobham–Edmonds thesis",
"answer_start": 324
}
],
"question": "What states that only problems that cannot be solved in polynomial time can be feasibly computed on some computational device?",
"id": "5ad56e5c5b96ef001a10aea0",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Even with a much faster computer",
"answer_start": 1016
}
],
"question": "When would a program not be useful for very small instances and in that sense the intractability of a problem is somewhat independent of technological progress?",
"id": "5ad56e5c5b96ef001a10aea1",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "a polynomial time algorithm",
"answer_start": 1223
}
],
"question": "What algorithm is always practical?",
"id": "5ad56e5c5b96ef001a10aea2",
"answers": [],
"is_impossible": true
}
],
"context": "Problems that can be solved in theory (e.g., given large but finite time), but which in practice take too long for their solutions to be useful, are known as intractable problems. In complexity theory, problems that lack polynomial-time solutions are considered to be intractable for more than the smallest inputs. In fact, the Cobham–Edmonds thesis states that only those problems that can be solved in polynomial time can be feasibly computed on some computational device. Problems that are known to be intractable in this sense include those that are EXPTIME-hard. If NP is not the same as P, then the NP-complete problems are also intractable in this sense. To see why exponential-time algorithms might be unusable in practice, consider a program that makes 2n operations before halting. For small n, say 100, and assuming for the sake of example that the computer does 1012 operations each second, the program would run for about 4 × 1010 years, which is the same order of magnitude as the age of the universe. Even with a much faster computer, the program would only be useful for very small instances and in that sense the intractability of a problem is somewhat independent of technological progress. Nevertheless, a polynomial time algorithm is not always practical. If its running time is, say, n15, it is unreasonable to consider it efficient and it is still useless except on small instances."
},
{
"qas": [
{
"question": "What eponymous variation of arithmetic presents a decision problem not evidenced in P?",
"id": "56e1febfe3433e1400423236",
"answers": [
{
"text": "Presburger arithmetic",
"answer_start": 219
},
{
"text": "Presburger",
"answer_start": 219
},
{
"text": "Presburger arithmetic",
"answer_start": 219
}
],
"is_impossible": false
},
{
"question": "Despite the Presburger problem, and in view of intractability, what has been done to establish solutions in reasonable periods of time?",
"id": "56e1febfe3433e1400423237",
"answers": [
{
"text": "algorithms have been written",
"answer_start": 276
},
{
"text": "algorithms have been written",
"answer_start": 276
},
{
"text": "algorithms have been written that solve the problem in reasonable times in most cases",
"answer_start": 276
}
],
"is_impossible": false
},
{
"question": "What is an example of a problem to which effective algorithms have provided a solution in spite of the intractability associated with the breadth of sizes?",
"id": "56e1febfe3433e1400423238",
"answers": [
{
"text": "NP-complete knapsack problem",
"answer_start": 399
},
{
"text": "NP-complete knapsack",
"answer_start": 399
},
{
"text": "the NP-complete knapsack problem",
"answer_start": 395
}
],
"is_impossible": false
},
{
"question": "How quickly can an algorithm solve an NP-complete knapsack problem?",
"id": "56e1febfe3433e1400423239",
"answers": [
{
"text": "in less than quadratic time",
"answer_start": 455
},
{
"text": "less than quadratic time",
"answer_start": 458
},
{
"text": "less than quadratic time",
"answer_start": 458
}
],
"is_impossible": false
},
{
"question": "What is the example of another problem characterized by large instances that is routinely solved by SAT handlers employing efficient algorithms?",
"id": "56e1febfe3433e140042323a",
"answers": [
{
"text": "NP-complete Boolean satisfiability problem",
"answer_start": 539
},
{
"text": "NP-complete Boolean satisfiability",
"answer_start": 539
},
{
"text": "the NP-complete Boolean satisfiability problem",
"answer_start": 535
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "Presburger arithmetic",
"answer_start": 219
}
],
"question": "What unknown variation of arithmetic presents a decision problem not evidenced in P?",
"id": "5ad56ef05b96ef001a10aea8",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "algorithms",
"answer_start": 276
}
],
"question": "What has not been done to establish solutions in reasonable period of time?",
"id": "5ad56ef05b96ef001a10aea9",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "algorithms",
"answer_start": 374
}
],
"question": "What can not solve the NP-complete knapsack problem over a wide range of sizes in less than quadratic time?",
"id": "5ad56ef05b96ef001a10aeaa",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "SAT solvers routinely handle large instances of the NP-complete Boolean satisfiability problem.",
"answer_start": 487
}
],
"question": "What do SAT solvers not usually handle when testing?",
"id": "5ad56ef05b96ef001a10aeab",
"answers": [],
"is_impossible": true
}
],
"context": "What intractability means in practice is open to debate. Saying that a problem is not in P does not imply that all large cases of the problem are hard or even that most of them are. For example, the decision problem in Presburger arithmetic has been shown not to be in P, yet algorithms have been written that solve the problem in reasonable times in most cases. Similarly, algorithms can solve the NP-complete knapsack problem over a wide range of sizes in less than quadratic time and SAT solvers routinely handle large instances of the NP-complete Boolean satisfiability problem."
},
{
"qas": [
{
"question": "What tactic did researchers employ to offset the former deficit of work surrounding the complexity of algorithmic problems?",
"id": "56e200e4cd28a01900c67c14",
"answers": [
{
"text": "foundations were laid out",
"answer_start": 110
},
{
"text": "numerous foundations were laid out",
"answer_start": 101
},
{
"text": "numerous foundations were laid out by various researchers",
"answer_start": 101
}
],
"is_impossible": false
},
{
"question": "Who was the most influential researcher among those grappling with the deficit of work surrounding the complexity posed by algorithmic problems?",
"id": "56e200e4cd28a01900c67c15",
"answers": [
{
"text": "Alan Turing",
"answer_start": 230
},
{
"text": "Alan Turing",
"answer_start": 230
},
{
"text": "Alan Turing",
"answer_start": 230
}
],
"is_impossible": false
},
{
"question": "What theoretical device is attributed to Alan Turing?",
"id": "56e200e4cd28a01900c67c16",
"answers": [
{
"text": "Turing machines",
"answer_start": 211
},
{
"text": "Turing machines",
"answer_start": 211
},
{
"text": "Turing machines",
"answer_start": 211
}
],
"is_impossible": false
},
{
"question": "In what year was the Alan Turing's definitional model of a computing device received?",
"id": "56e200e4cd28a01900c67c17",
"answers": [
{
"text": "1936",
"answer_start": 245
},
{
"text": "1936",
"answer_start": 245
},
{
"text": "1936",
"answer_start": 245
}
],
"is_impossible": false
},
{
"question": "In the most basic sense what did a Turing machine emulate?",
"id": "56e200e4cd28a01900c67c18",
"answers": [
{
"text": "a computer",
"answer_start": 319
},
{
"text": "a computer",
"answer_start": 319
},
{
"text": "a computer",
"answer_start": 319
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "foundations",
"answer_start": 110
}
],
"question": "What were laid out by various companies?",
"id": "5ad56fe65b96ef001a10aec2",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "foundations were laid out",
"answer_start": 110
}
],
"question": "What tactic did companies employ to offset the former deficit of work surrounding the complexity of algorithmic problems?",
"id": "5ad56fe65b96ef001a10aec3",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Alan Turing",
"answer_start": 230
}
],
"question": "Who was the least influential researcher working on the complexity posed by algorithmic problems?",
"id": "5ad56fe65b96ef001a10aec4",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Turing machines",
"answer_start": 211
}
],
"question": "What device did Alan Turning invent in 1974?",
"id": "5ad56fe65b96ef001a10aec5",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "computer",
"answer_start": 321
}
],
"question": "What was the Turning calculator a robust and flexible simplification of?",
"id": "5ad56fe65b96ef001a10aec6",
"answers": [],
"is_impossible": true
}
],
"context": "Before the actual research explicitly devoted to the complexity of algorithmic problems started off, numerous foundations were laid out by various researchers. Most influential among these was the definition of Turing machines by Alan Turing in 1936, which turned out to be a very robust and flexible simplification of a computer."
},
{
"qas": [
{
"question": "What paper is commonly considered the bellwether ushering in systematic studies computational complexity?",
"id": "56e202e9e3433e1400423240",
"answers": [
{
"text": "On the Computational Complexity of Algorithms",
"answer_start": 137
},
{
"text": "On the Computational Complexity of Algorithms",
"answer_start": 137
},
{
"text": "\"On the Computational Complexity of Algorithms\"",
"answer_start": 136
}
],
"is_impossible": false
},
{
"question": "What individuals were responsible for authoring \"On the Computational Complexity of Algorithms\"?",
"id": "56e202e9e3433e1400423241",
"answers": [
{
"text": "Juris Hartmanis and Richard Stearns",
"answer_start": 187
},
{
"text": "Juris Hartmanis and Richard Stearns",
"answer_start": 187
},
{
"text": "Juris Hartmanis and Richard Stearns",
"answer_start": 187
}
],
"is_impossible": false
},
{
"question": "In what year was Hatmanis and Stearn's seminal work in computational complexity received? ",
"id": "56e202e9e3433e1400423242",
"answers": [
{
"text": "1965",
"answer_start": 224
},
{
"text": "1965",
"answer_start": 224
},
{
"text": "1965",
"answer_start": 224
}
],
"is_impossible": false
},
{
"question": "What complex measurements were defined by \"On the Computational Complexity of Algorithms\"?",
"id": "56e202e9e3433e1400423243",
"answers": [
{
"text": "time and space",
"answer_start": 265
},
{
"text": "definitions of time and space complexity",
"answer_start": 250
},
{
"text": "time and space complexity",
"answer_start": 265
}
],
"is_impossible": false
},
{
"question": "In what year did Edmond's characterize a \"good\" algorithm?",
"id": "56e202e9e3433e1400423244",
"answers": [
{
"text": "1965",
"answer_start": 224
},
{
"text": "1965",
"answer_start": 335
},
{
"text": "1965",
"answer_start": 335
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "On the Computational Complexity of Algorithms",
"answer_start": 137
}
],
"question": "What seminal paper is commonly considered the beginning of sociology studies?",
"id": "5ad570b25b96ef001a10aedc",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Juris Hartmanis and Richard Stearns",
"answer_start": 187
}
],
"question": "Who wrote \"On the Computational Complexity of Science\"?",
"id": "5ad570b25b96ef001a10aedd",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "On the Computational Complexity of Algorithms",
"answer_start": 137
}
],
"question": "What seminal paper was written by Juris Hartmanis and Richard Stearns in 1975?",
"id": "5ad570b25b96ef001a10aede",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "time and space",
"answer_start": 265
}
],
"question": "What simple measurements were defined by \"On the Computational Complexity of Algorithms\"?",
"id": "5ad570b25b96ef001a10aedf",
"answers": [],
"is_impossible": true
}
],
"context": "As Fortnow & Homer (2003) point out, the beginning of systematic studies in computational complexity is attributed to the seminal paper \"On the Computational Complexity of Algorithms\" by Juris Hartmanis and Richard Stearns (1965), which laid out the definitions of time and space complexity and proved the hierarchy theorems. Also, in 1965 Edmonds defined a \"good\" algorithm as one with running time bounded by a polynomial of the input size."
},
{
"qas": [
{
"question": "Who provided a definition of linear bounded automata in 1960?",
"id": "56e2042ecd28a01900c67c1e",
"answers": [
{
"text": "John Myhill",
"answer_start": 102
},
{
"text": "John Myhill",
"answer_start": 102
},
{
"text": "John Myhill",
"answer_start": 102
}
],
"is_impossible": false
},
{
"question": "In what year did Raymond Sullivan publish a study of rudimentary sets?",
"id": "56e2042ecd28a01900c67c1f",
"answers": [
{
"text": "1961",
"answer_start": 215
},
{
"text": "1961",
"answer_start": 215
},
{
"text": "1961",
"answer_start": 215
}
],
"is_impossible": false
},
{
"question": "In 1962, who was responsible for the authorship of a paper published on real time-computations?",
"id": "56e2042ecd28a01900c67c20",
"answers": [
{
"text": "Hisao Yamada",
"answer_start": 233
},
{
"text": "Hisao Yamada",
"answer_start": 233
},
{
"text": "Hisao Yamada",
"answer_start": 233
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "John Myhill's",
"answer_start": 102
}
],
"question": "Who wrote later papers studying problems solvable by Turning machines?",
"id": "5ad5719f5b96ef001a10aeec",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "John Myhill's",
"answer_start": 102
}
],
"question": "Who provided a definition of linear bounded automata in 1970?",
"id": "5ad5719f5b96ef001a10aeed",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "1961",
"answer_start": 215
}
],
"question": "What year did Dick Sullivan publish a study on rudimentary sets?",
"id": "5ad5719f5b96ef001a10aeee",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Hisao Yamada",
"answer_start": 233
}
],
"question": "Who wrote a paper on real time computations in 1973?",
"id": "5ad5719f5b96ef001a10aeef",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Boris Trakhtenbrot",
"answer_start": 306
}
],
"question": "Who was pioneer and studied specific complexity measure in 1948?",
"id": "5ad5719f5b96ef001a10aef0",
"answers": [],
"is_impossible": true
}
],
"context": "Earlier papers studying problems solvable by Turing machines with specific bounded resources include John Myhill's definition of linear bounded automata (Myhill 1960), Raymond Smullyan's study of rudimentary sets (1961), as well as Hisao Yamada's paper on real-time computations (1962). Somewhat earlier, Boris Trakhtenbrot (1956), a pioneer in the field from the USSR, studied another specific complexity measure. As he remembers:"
},
{
"qas": [
{
"question": "What is the concrete choice typically assumed by most complexity-theoretic theorems?",
"id": "56e20a27cd28a01900c67c24",
"answers": [
{
"text": "input encoding",
"answer_start": 98
},
{
"text": "input encoding",
"answer_start": 98
},
{
"text": "input encoding",
"answer_start": 98
}
],
"is_impossible": false
},
{
"question": "In the effort of maintaining a level of abstraction, what choice is typically left independent?",
"id": "56e20a27cd28a01900c67c25",
"answers": [
{
"text": "encoding",
"answer_start": 104
},
{
"text": "encoding",
"answer_start": 198
},
{
"text": "encoding",
"answer_start": 198
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "encoding",
"answer_start": 198
}
],
"question": "What can not be achieved by ensuring different representations can transformed into each other efficiently?",
"id": "5ad53ac65b96ef001a10abac",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "input encoding",
"answer_start": 98
}
],
"question": "What is the abstract choice typically assumed by most complexity-theoretic theorems?",
"id": "5ad53ac65b96ef001a10abad",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "complexity-theoretic theorems",
"answer_start": 27
}
],
"question": "What does not regularly use input coding as its concrete choice?",
"id": "5ad53ac65b96ef001a10abae",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "encoding",
"answer_start": 198
}
],
"question": "What choice is typically left dependent in an effort to maintain a level of abstraction?",
"id": "5ad53ac65b96ef001a10abaf",
"answers": [],
"is_impossible": true
}
],
"context": "Even though some proofs of complexity-theoretic theorems regularly assume some concrete choice of input encoding, one tries to keep the discussion abstract enough to be independent of the choice of encoding. This can be achieved by ensuring that different representations can be transformed into each other efficiently."
},
{
"qas": [
{
"question": "Who is responsible for axiomatic complexity theory?",
"id": "56e20a3ae3433e140042324a",
"answers": [
{
"text": "Manuel Blum",
"answer_start": 9
},
{
"text": "Manuel Blum",
"answer_start": 9
},
{
"text": "Manuel Blum",
"answer_start": 9
}
],
"is_impossible": false
},
{
"question": "What theorem was implicated by Manuel Blum's axioms?",
"id": "56e20a3ae3433e140042324b",
"answers": [
{
"text": "speed-up theorem",
"answer_start": 129
},
{
"text": "speed-up theorem",
"answer_start": 129
},
{
"text": "speed-up theorem",
"answer_start": 129
}
],
"is_impossible": false
},
{
"question": "What is the paper written by Richard Karp in 1972 that ushered in a new era of understanding between intractability and NP-complete problems?",
"id": "56e20a3ae3433e140042324d",
"answers": [
{
"text": "\"Reducibility Among Combinatorial Problems\"",
"answer_start": 433
},
{
"text": "Reducibility Among Combinatorial Problems",
"answer_start": 434
},
{
"text": "\"Reducibility Among Combinatorial Problems\"",
"answer_start": 433
}
],
"is_impossible": false
},
{
"question": "How many combinatory and graph theoretical problems, formerly believed to be plagued by intractability, did Karp's paper address?",
"id": "56e20a3ae3433e140042324e",
"answers": [
{
"text": "21",
"answer_start": 502
},
{
"text": "21",
"answer_start": 502
},
{
"text": "21",
"answer_start": 502
}
],
"is_impossible": false
},
{
"plausible_answers": [
{
"text": "Manuel Blum",
"answer_start": 9
}
],
"question": "Who developed an axiomatic complexity theory based on his axioms in 1974?",
"id": "5ad572b15b96ef001a10af06",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Manuel Blum",
"answer_start": 9
}
],
"question": "Who is responsible for the so-called, speed-up theorem n 1974?",
"id": "5ad572b15b96ef001a10af07",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Stephen Cook and, working independently, Leonid Levin",
"answer_start": 213
}
],
"question": "Who proved that these exist practical relevant problems that are NP-complete in 1961?",
"id": "5ad572b15b96ef001a10af08",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Richard Karp",
"answer_start": 365
}
],
"question": "Who wrote the paper \"Reductibility Among Combinatorial Problems\" in 1974?",
"id": "5ad572b15b96ef001a10af09",
"answers": [],
"is_impossible": true
},
{
"plausible_answers": [
{
"text": "Reducibility Among Combinatorial Problems\"",
"answer_start": 434
}
],
"question": "What book featured 25 diverse comninatorial and graph theoretical problems each famous for its computational intractability?",
"id": "5ad572b15b96ef001a10af0a",
"answers": [],
"is_impossible": true
}
],
"context": "In 1967, Manuel Blum developed an axiomatic complexity theory based on his axioms and proved an important result, the so-called, speed-up theorem. The field really began to flourish in 1971 when the US researcher Stephen Cook and, working independently, Leonid Levin in the USSR, proved that there exist practically relevant problems that are NP-complete. In 1972, Richard Karp took this idea a leap forward with his landmark paper, \"Reducibility Among Combinatorial Problems\", in which he showed that 21 diverse combinatorial and graph theoretical problems, each infamous for its computational intractability, are NP-complete."
}
]
}
]
}
Reference in New Issue View Git Blame Copy Permalink