{"id":"W3125782344","doi":"","title":"How to Run Turing Machines on Encrypted Data","year":2013,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Turing machine; Functional encryption; Turing machine examples; Computer science; Encryption; Theoretical computer science; Universal Turing machine; Time hierarchy theorem; Cryptography; Homomorphic encryption; Scheme (mathematics); Non-deterministic Turing machine; Super-recursive algorithm; Construct (python library); Block (permutation group theory); NSPACE; Turing; Key (lock); Algorithm; Mathematics; Computation; Computer network; Computer security; Ciphertext; 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.0001176536,0.0001036923,0.00008638995,0.0001068977,0.00008597103,0.000662133,0.002235095,0.00002798754,0.0001045534],"category_scores_gemma":[0.00005721036,0.00007759667,0.00002436497,0.0003588918,0.00001332971,0.001451249,0.001244933,0.00008558145,0.0003223891],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004699233,"about_ca_system_score_gemma":0.0000090112,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003134004,"about_ca_topic_score_gemma":0.00007281473,"domain_scores_codex":[0.9990206,0.00002265855,0.00008468677,0.0004676581,0.0001915119,0.0002128255],"domain_scores_gemma":[0.9978353,0.00005952634,0.00002073233,0.001915168,0.00003101849,0.0001382],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000005043967,0.0001445303,0.001535743,0.00001466873,0.00002193731,0.000009227701,0.000398567,0.000007938064,0.002607988,0.5895489,0.174209,0.2314965],"study_design_scores_gemma":[0.001211025,0.0005668232,0.1252854,0.00009642062,0.00001575018,0.00003535577,0.0002000342,0.2316964,0.01316416,0.09998263,0.5258458,0.001900282],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05962499,0.00004225921,0.9171135,0.01305409,0.0004654008,0.0003168734,0.00004089066,0.0004552732,0.008886704],"genre_scores_gemma":[0.761763,0.000006666345,0.2353898,0.002494566,0.0001384671,0.00001439295,0.00004966707,0.000006142121,0.0001372408],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.702138,"threshold_uncertainty_score":0.6384963,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03098249483124182,"score_gpt":0.2505727783208249,"score_spread":0.219590283489583,"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."}}