Computability

Algorithms and theory of computation handbook(2011)

引用 26|浏览23
暂无评分
摘要
Intends to lay a common basis for the different branches of recursion theory. Leads from the very basic theory to modern concepts of computability. Consists of three consecutive parts: 1. Basic Concepts of Computability. 2. Traditional Recursion Theory. 3. Unified Type 2 theory of constructivity and computability on Baire's space including a general the- ory of representations.
更多
查看译文
关键词
recursion theory,Unified Type,basic theory,modern concept,Traditional Recursion Theory,consecutive part,common basis,Basic Concepts,different branch
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要