{"title":"Turing's Password: What Internet Cannot Leak","authors":"L. Levin","doi":"10.1109/LICS.2012.11","DOIUrl":null,"url":null,"abstract":"Summary form only given. I use a revised, more robust, notion of computability to answer bothersome questions that are not even easy to ask with any clarity.","PeriodicalId":407972,"journal":{"name":"2012 27th Annual IEEE Symposium on Logic in Computer Science","volume":"68 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 27th Annual IEEE Symposium on Logic in Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LICS.2012.11","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
Summary form only given. I use a revised, more robust, notion of computability to answer bothersome questions that are not even easy to ask with any clarity.