{"id":"W2188019447","doi":"","title":"Computational complexity in analysis and geometry","year":2011,"lang":"en","type":"dissertation","venue":"TSpace","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"PSPACE; Complexity class; Theoretical computer science; Computable function; Turing machine; Generality; Computability; Computational complexity theory; Mathematics; DTIME; Descriptive complexity theory; Structural complexity theory; Bounded function; Computational resource; Average-case complexity; Computability theory; Model of computation; Computer science; Worst-case complexity; Discrete mathematics; Computation; Algorithm; Universal Turing machine","routes":{"ca_aff":true,"ca_fund":true,"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.002363268,0.0009071408,0.001123355,0.002353466,0.001584481,0.005493146,0.001176347,0.001435575,0.005911343],"category_scores_gemma":[0.007195222,0.0004302121,0.00168988,0.002572048,0.01048176,0.009403106,0.002887873,0.006474658,0.0009283234],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005149937,"about_ca_system_score_gemma":0.001488982,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00226633,"about_ca_topic_score_gemma":0.001176746,"domain_scores_codex":[0.9972698,0.001084622,0.0001450598,0.0004959037,0.0007964157,0.0002082345],"domain_scores_gemma":[0.9942858,0.004105801,0.0002267128,0.0007731517,0.0004467904,0.000161758],"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.000002135145,0.000002368548,0.00004165433,0.00003466715,0.000005490856,0.000007534009,0.0000554689,0.0006861119,0.00005064705,0.9957902,0.001019417,0.002304347],"study_design_scores_gemma":[0.000002380986,0.000004102867,0.00009276374,0.00001967136,0.000002681836,0.00001547554,0.00002839314,0.001317156,0.00005699051,0.9854745,0.0129824,0.000003534788],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.02959248,0.0706232,0.5757812,0.05157086,0.001851146,0.0001409004,0.0009537895,0.0004133297,0.2690731],"genre_scores_gemma":[0.730858,0.04701722,0.1757267,0.005152059,0.006405155,0.0005850954,0.001168415,0.0003856042,0.03270165],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.005911343,"threshold_uncertainty_score":0.03736556,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05059501843682875,"score_gpt":0.3370172537598183,"score_spread":0.2864222353229895,"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."}}