{"id":"W1519448302","doi":"10.1007/3-540-45655-4_63","title":"Quantum DNF Learnability Revisited","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Learnability; Computer science; Probably approximately correct learning; Computational complexity theory; Quantum; Upper and lower bounds; Theoretical computer science; Algorithm; Quantum complexity theory; Quantum algorithm; Mathematics; Artificial intelligence; Computational learning theory; Physics; Quantum mechanics; Active learning (machine learning)","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001400776,0.0008840564,0.0009274097,0.001028222,0.0005059083,0.0008657636,0.005309293,0.0004775022,0.00008303921],"category_scores_gemma":[0.0002283997,0.0007803981,0.0003168888,0.001169993,0.0009222063,0.0004750052,0.002382221,0.001972154,0.0001732666],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003452952,"about_ca_system_score_gemma":0.0003611165,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001941486,"about_ca_topic_score_gemma":0.000007184463,"domain_scores_codex":[0.9936613,0.00009877283,0.000856694,0.002740593,0.001483063,0.001159558],"domain_scores_gemma":[0.9953753,0.0006684487,0.0004382662,0.002833486,0.0003429927,0.000341525],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004072542,0.00005712693,0.00006543584,0.00008407659,0.00001589522,0.0002158575,0.000672068,0.04235955,0.00003965436,0.030089,0.0001047471,0.9262925],"study_design_scores_gemma":[0.0002051453,0.0001934188,0.0002211041,0.0004274054,0.000006771578,0.0001414646,4.919233e-8,0.8253211,0.0001221394,0.1671917,0.005361511,0.0008081996],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002910209,0.0009768422,0.9906263,0.00165352,0.001852696,0.0004635242,0.000007884893,0.0005186975,0.003609537],"genre_scores_gemma":[0.2341148,0.0002162291,0.757444,0.003965497,0.002367998,0.00001532538,0.00001525676,0.0001628057,0.001698114],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9254843,"threshold_uncertainty_score":0.9994647,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01595667363785375,"score_gpt":0.238833618796619,"score_spread":0.2228769451587653,"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."}}