{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001157968,0.000346865,0.0007664151,0.0005805417,0.001421666,0.001651228,0.00104923,0.001105945,0.004468711],"category_scores_gemma":[0.003148208,0.0002443388,0.0006835939,0.0004829892,0.001410421,0.003260585,0.003643104,0.001766978,0.000836676],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008816452,"about_ca_system_score_gemma":0.000978324,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002177204,"about_ca_topic_score_gemma":0.0003261294,"domain_scores_codex":[0.9987333,0.0003836379,0.00007762683,0.0002440656,0.0003063985,0.0002548648],"domain_scores_gemma":[0.9987535,0.0003526175,0.00007843642,0.0005725988,0.000127132,0.0001156247],"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.0003197287,0.00006488722,0.0007835288,0.0001341942,0.00003588755,0.0001956523,0.0002530116,0.01310056,0.007850007,0.9527506,0.00276261,0.02174941],"study_design_scores_gemma":[0.0000442103,0.00007717336,0.0004761395,0.00003390132,0.00003819954,0.0002173446,0.00004827641,0.1926557,0.01389751,0.7859566,0.00652204,0.00003278861],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3092169,0.001098078,0.6181961,0.003506505,0.0006485139,0.0001672804,0.0004292264,0.001157533,0.06557991],"genre_scores_gemma":[0.9585834,0.0001847472,0.02904001,0.000161832,0.0001155118,0.00007484708,0.0001246863,0.00006718475,0.01164778],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004468711,"threshold_uncertainty_score":0.01494932,"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."}}