{"id":"W2967486788","doi":"10.20368/1971-8829/1399","title":"A Gentle Introduction to Computational Complexity Through an Examination of Noodle Making","year":2019,"lang":"en","type":"article","venue":"Institutional Research Information System (Università degli Studi di Trento)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computational resource; Computational complexity theory; Computer science; Computational problem; CITES; Complexity science; Worst-case complexity; Asymptotic computational complexity; Algorithmic complexity; Computational model; Computational thinking; Algorithm; Theoretical computer science; Artificial intelligence; Management science; Engineering","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001484408,0.0007272866,0.0003819555,0.002218761,0.002693882,0.003478715,0.001136391,0.001124357,0.01029864],"category_scores_gemma":[0.006994477,0.0003112354,0.0008914274,0.002458454,0.008890549,0.007918337,0.002101579,0.004577369,0.003022383],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002218961,"about_ca_system_score_gemma":0.001244875,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001857921,"about_ca_topic_score_gemma":0.002703168,"domain_scores_codex":[0.9986895,0.0004810905,0.000104976,0.0001946776,0.0004201648,0.0001096495],"domain_scores_gemma":[0.9966889,0.002395331,0.0001295783,0.0002390398,0.0004601369,0.00008699518],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001396256,0.00001862955,0.0002901449,0.0001123926,0.000004454766,0.00008997129,0.0006540898,0.0005254261,0.0003036806,0.9415829,0.02966282,0.02674158],"study_design_scores_gemma":[0.000003004011,0.0000276663,0.0006813585,0.0001299177,0.000003150553,0.0002620321,0.0003663587,0.001709716,0.0002942684,0.5464326,0.4500725,0.00001753158],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.01004105,0.02388354,0.2880672,0.04838759,0.007279625,0.0002581759,0.0002939416,0.0003952765,0.6213935],"genre_scores_gemma":[0.2935962,0.04620339,0.3619714,0.02252733,0.01681882,0.0007650838,0.0005626687,0.0008648098,0.2566902],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.01029864,"threshold_uncertainty_score":0.03445238,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1202651698161973,"score_gpt":0.3463692520809213,"score_spread":0.226104082264724,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}