{"title":"图灵测试和非信息流","authors":"Randy Brown","doi":"10.1109/RISP.1991.130804","DOIUrl":null,"url":null,"abstract":"Shows how the Turing Test provides a very simple yet very general characterization of non-information flow in multilevel information systems. Despite its conceptual simplicity, the Turing Test provides the study of information flow with an extremely useful notion which seems to be a significant departure from other current information flow theories. Turing's powerful idea is that information entropy is represented as uncertainty about the mathematical definition of a system, rather than as some function of the direct behavior of the system.<<ETX>>","PeriodicalId":445112,"journal":{"name":"Proceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy","volume":"75 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"22","resultStr":"{\"title\":\"The Turing Test and non-information flow\",\"authors\":\"Randy Brown\",\"doi\":\"10.1109/RISP.1991.130804\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Shows how the Turing Test provides a very simple yet very general characterization of non-information flow in multilevel information systems. Despite its conceptual simplicity, the Turing Test provides the study of information flow with an extremely useful notion which seems to be a significant departure from other current information flow theories. Turing's powerful idea is that information entropy is represented as uncertainty about the mathematical definition of a system, rather than as some function of the direct behavior of the system.<<ETX>>\",\"PeriodicalId\":445112,\"journal\":{\"name\":\"Proceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy\",\"volume\":\"75 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-05-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"22\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RISP.1991.130804\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RISP.1991.130804","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Shows how the Turing Test provides a very simple yet very general characterization of non-information flow in multilevel information systems. Despite its conceptual simplicity, the Turing Test provides the study of information flow with an extremely useful notion which seems to be a significant departure from other current information flow theories. Turing's powerful idea is that information entropy is represented as uncertainty about the mathematical definition of a system, rather than as some function of the direct behavior of the system.<>