{"id":"W2897693141","doi":"10.1016/j.tcs.2018.10.012","title":"Perennial secure multi-party computation of universal Turing machine","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Calgary","funders":"Ben-Gurion University of the Negev; Israel Science Foundation","keywords":"Turing machine; Computer science; Computation; Theoretical computer science; Universal Turing machine; Set (abstract data type); Time hierarchy theorem; Model of computation; Super-recursive algorithm; Non-deterministic Turing machine; Theory of computation; Time complexity; Algorithm; 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":["sts"],"consensus_categories":[],"category_scores_codex":[0.0008710622,0.0001684382,0.0002030614,0.0002488502,0.0003958796,0.0001950053,0.001995387,0.00005520775,0.00003437875],"category_scores_gemma":[0.00004189805,0.0001431697,0.00007926801,0.001379278,0.004336011,0.0008797026,0.001225869,0.0001805685,0.00002868058],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003002685,"about_ca_system_score_gemma":0.0001005432,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001707538,"about_ca_topic_score_gemma":0.000006641457,"domain_scores_codex":[0.9979928,0.0001016286,0.000269827,0.0006337498,0.0005723427,0.0004296764],"domain_scores_gemma":[0.9986463,0.0001054881,0.0001001666,0.0006127467,0.0003158022,0.0002194926],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001670493,0.0001022289,0.0001946676,0.000009218335,0.000004587823,0.000005077749,0.001385765,0.00004901764,0.001002553,0.9840326,0.0000262434,0.01317129],"study_design_scores_gemma":[0.0004991085,0.0003567057,0.003223728,0.00003171716,0.000005593144,0.00002326088,0.00001242509,0.9203191,0.008370429,0.06686977,0.00007920522,0.0002089597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1036001,0.00002140881,0.8947232,0.0001758025,0.0005798422,0.0001044233,0.000009795466,0.0001406563,0.0006447232],"genre_scores_gemma":[0.7073659,0.000001524161,0.2924286,0.00009309928,0.000104306,6.096877e-7,0.000001962138,0.00000355714,3.789429e-7],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9202701,"threshold_uncertainty_score":0.9983736,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01146691164390881,"score_gpt":0.258196179037084,"score_spread":0.2467292673931752,"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."}}