{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006013756,0.0002229115,0.0002689484,0.0001415946,0.0005787816,0.0002005527,0.001113044,0.00006936792,0.000005264878],"category_scores_gemma":[0.00004857805,0.0001702771,0.0001295794,0.0004403162,0.0001189074,0.0007680392,0.0001446999,0.0001469545,0.00001039633],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003734431,"about_ca_system_score_gemma":0.00007473966,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002459275,"about_ca_topic_score_gemma":9.645258e-7,"domain_scores_codex":[0.9982938,0.000101031,0.0004268152,0.0004075445,0.0003274145,0.0004434549],"domain_scores_gemma":[0.9985077,0.0004357905,0.0003438528,0.0004639296,0.0001771861,0.00007153333],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005558913,0.0001065003,0.00003655407,0.00004483006,0.00002145376,0.000002260767,0.0009516624,0.940899,0.0004750575,0.03980532,0.01112995,0.00647178],"study_design_scores_gemma":[0.0004063009,0.00007220868,0.0001126858,0.00007522333,0.00000910676,0.000008446719,0.00001251665,0.9727761,0.0001542899,0.02597848,0.0001800298,0.0002145932],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01091127,0.00004548712,0.9769579,0.008326756,0.00005353239,0.0004073197,0.000002709101,0.0004749346,0.002820077],"genre_scores_gemma":[0.5209488,0.00002747707,0.4759495,0.002775956,0.00004617549,0.00007910174,0.00001126559,0.00001866029,0.0001431261],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5100375,"threshold_uncertainty_score":0.6943699,"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."}}