Topic
Computability
About: Computability is a research topic. Over the lifetime, 2829 publications have been published within this topic receiving 85162 citations.
Papers published on a yearly basis
Papers
More filters
Book•
01 Jan 2008
TL;DR: The author elaborates on and clarifies many of Turings statements, making the original difficult-to-read document accessible to present day programmers, computer science majors, math geeks, and others.
Abstract: Programming Legend Charles Petzold unlocks the secrets of the extraordinary and prescient 1936 paper by Alan M. Turing Mathematician Alan Turing invented an imaginary computer known as the Turing Machine; in an age before computers, he explored the concept of what it meant to be computable, creating the field of computability theory in the process, a foundation of present-day computer programming. The book expands Turings original 36-page paper with additional background chapters and extensive annotations; the author elaborates on and clarifies many of Turings statements, making the original difficult-to-read document accessible to present day programmers, computer science majors, math geeks, and others. Interwoven into the narrative are the highlights of Turings own life: his years at Cambridge and Princeton, his secret work in cryptanalysis during World War II, his involvement in seminal computer projects, his speculations about artificial intelligence, his arrest and prosecution for the crime of "gross indecency," and his early death by apparent suicide at the age of 41.
78 citations
20 Sep 1999
TL;DR: The expressive power of OCL in terms of navigability and computability is examined and it is showed that OCL is not equivalent to the relational calculus, which means an algorithm computing the transitive closure of a binary relation is expressed in OCL.
Abstract: This paper examines the expressive power of OCL in terms of navigability and computability. First the expressive power of OCL is compared with the relational calculus; it is showed that OCL is not equivalent to the relational calculus. Then an algorithm computing the transitive closure of a binary relation -operation that cannot be encoded in the relational calculus- is expressed in OCL. Finally the equivalence of OCL with a Turing machine is pondered.
78 citations
TL;DR: An operational semantics of a basic class of P systems is defined, and two implementations of the operational semantics using rewriting logic are given, including two operational correspondence results.
78 citations
30 Jun 2006
TL;DR: A version of Krivine's machine which provides a precise information about how much of its argument is needed for performing a computation is introduced and studied to show that Taylor expansion oflambda-terms (an operation mapping lambda-terms to generally infinite linear combinations of resource Lambda-terms) commutes with Bohm tree computation.
Abstract: We introduce and study a version of Krivine's machine which provides a precise information about how much of its argument is needed for performing a computation. This information is expressed as a term of a resource lambda-calculus introduced by the authors in a recent article; this calculus can be seen as a fragment of the differential lambda-calculus. We use this machine to show that Taylor expansion of lambda-terms (an operation mapping lambda-terms to generally infinite linear combinations of resource lambda-terms) commutes with Bohm tree computation.
77 citations
TL;DR: As computability implies value definiteness, certain sequences of quantum outcomes cannot be computable as discussed by the authors. But they are computable in the sense that they have a value and can be defined.
Abstract: As computability implies value definiteness, certain sequences of quantum outcomes cannot be computable.
76 citations