{"id":"W199059760","doi":"10.1142/s0129626401000646","title":"ON THE NECESSITY OF FORMAL MODELS FOR REAL-TIME PARALLEL COMPUTATIONS","year":2001,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Turing machine; Computer science; Computation; Universal Turing machine; Super-recursive algorithm; Model of computation; Time hierarchy theorem; Turing machine examples; Probabilistic Turing machine; Theoretical computer science; Hierarchy; NSPACE; Description number; Real number; Time complexity; Theory of computation; Formal proof; Turing; Algorithm; Discrete mathematics; Mathematics; Programming language","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.007323104,0.0009151633,0.001202209,0.001190669,0.002442155,0.005684533,0.00253356,0.00235086,0.004459222],"category_scores_gemma":[0.02722998,0.001063666,0.002440345,0.0009608874,0.009985324,0.01842737,0.004505999,0.005851758,0.0009536544],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002891101,"about_ca_system_score_gemma":0.002108727,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001255902,"about_ca_topic_score_gemma":0.001119625,"domain_scores_codex":[0.994134,0.002237781,0.0004997014,0.0008206049,0.001685652,0.000622165],"domain_scores_gemma":[0.9640697,0.02339249,0.002588522,0.005935797,0.002581523,0.001432085],"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.0000174483,0.00001755944,0.00008490735,0.00004076694,0.000004582997,0.00005271108,0.0001797492,0.004235007,0.0003260321,0.993468,0.0003141918,0.001259028],"study_design_scores_gemma":[0.00002036789,0.00001857272,0.00003977573,0.00002327544,0.000006187048,0.00006327295,0.0000721867,0.02923504,0.0004903399,0.9670415,0.002975984,0.00001358499],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.05361316,0.0009227653,0.9136171,0.009638255,0.000253927,0.000128063,0.0001828159,0.0007214572,0.02092236],"genre_scores_gemma":[0.7785933,0.001008039,0.21136,0.001494625,0.0005277729,0.0006554808,0.0004164134,0.0003360049,0.00560833],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.007323104,"threshold_uncertainty_score":0.03872871,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02905549084550148,"score_gpt":0.269250657233118,"score_spread":0.2401951663876165,"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."}}