arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1402.2949cs.PLcs.LO
收藏

一种面向程序设计语言的可计算性方法

A Programming Language Oriented Approach to Computability

Aaron Karper

摘要:

可计算性和复杂性领域是计算机科学的发源地。图灵、丘奇和克莱因都发展了形式主义,证明了他们所认为的“直观可计算”。然而,时代在变化,今天的(有抱负的)计算机科学家在构建自动机或编写函数方面不那么精通,他们更熟悉程序设计语言的世界。本文将尝试以更适合现代开发人员的形式介绍可计算性理论和复杂性的典型概念。它主要以\cite{jones}为基础,但也从其他来源获取输入,以提供示例、附加信息等。

英文摘要:

The field of computability and complexity was, where computer science sprung from. Turing, Church, and Kleene all developed formalisms that demonstrated what they held "intuitively computable". The times change however and today's (aspiring) computer scientists are less proficient in building automata or composing functions and are much more native to the world of programming languages. This article will try to introduce typical concepts of computability theory and complexity in a form more fitted for a modern developer. It is mostly based on \cite{jones}, but takes input from other sources to provide examples, additional information, etc.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑