可计算性、复杂性和语言——理论计算机科学的基础

Computer Science and Applied Mathematics Pub Date : 2014-09-23 DOI:10.5860/choice.32-0356

Martin D. Davis, E. Weyuker

{"title":"可计算性、复杂性和语言——理论计算机科学的基础","authors":"Martin D. Davis, E. Weyuker","doi":"10.5860/choice.32-0356","DOIUrl":null,"url":null,"abstract":"Preliminaries. Computability: Programs and Computable Functions. Primitive Recursive Functions. A Universal Program. Calculations on Strings. Turing Machines. Processes and Grammars. Classifying Unsolvable Problems. Grammars and Automata: Regular Languages. Context-Free Languages. Context-Sensitive Languages. Logic: Propositional Calculus. Quantification Theory. Complexity: Abstract Complexity. Polynomial Time Computability. Semantics: Approximation Orderings. Denotational Semantics of Recursion Equations. Operational Semantics of Recursion Equations. Suggestions for Further Reading. Subject Index.","PeriodicalId":444502,"journal":{"name":"Computer Science and Applied Mathematics","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"306","resultStr":"{\"title\":\"Computability, complexity, and languages - fundamentals of theoretical computer science\",\"authors\":\"Martin D. Davis, E. Weyuker\",\"doi\":\"10.5860/choice.32-0356\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Preliminaries. Computability: Programs and Computable Functions. Primitive Recursive Functions. A Universal Program. Calculations on Strings. Turing Machines. Processes and Grammars. Classifying Unsolvable Problems. Grammars and Automata: Regular Languages. Context-Free Languages. Context-Sensitive Languages. Logic: Propositional Calculus. Quantification Theory. Complexity: Abstract Complexity. Polynomial Time Computability. Semantics: Approximation Orderings. Denotational Semantics of Recursion Equations. Operational Semantics of Recursion Equations. Suggestions for Further Reading. Subject Index.\",\"PeriodicalId\":444502,\"journal\":{\"name\":\"Computer Science and Applied Mathematics\",\"volume\":\"39 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-09-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"306\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computer Science and Applied Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.5860/choice.32-0356\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Science and Applied Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5860/choice.32-0356","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 306

摘要

开场白。可计算性:程序和可计算函数。原始递归函数。一个通用程序。字符串上的计算。图灵机。过程和语法。分类无法解决的问题。语法和自动机:规则语言。上下文无关语言。上下文敏感的语言。逻辑:命题演算。量化理论。复杂性:抽象的复杂性。多项式时间可计算性。语义:近似排序。递归方程的指称语义。递归方程的运算语义。进一步阅读的建议。主题索引。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Computability, complexity, and languages - fundamentals of theoretical computer science

Preliminaries. Computability: Programs and Computable Functions. Primitive Recursive Functions. A Universal Program. Calculations on Strings. Turing Machines. Processes and Grammars. Classifying Unsolvable Problems. Grammars and Automata: Regular Languages. Context-Free Languages. Context-Sensitive Languages. Logic: Propositional Calculus. Quantification Theory. Complexity: Abstract Complexity. Polynomial Time Computability. Semantics: Approximation Orderings. Denotational Semantics of Recursion Equations. Operational Semantics of Recursion Equations. Suggestions for Further Reading. Subject Index.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Computer Science and Applied Mathematics

自引率

0.00%

发文量