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
TL;DR: This contribution introduces computability on the set M of probability measures on the Borel subsets of the unit interval, and shows that simple obvious requirements exclude a number of similar definitions, that the definition leads to the expected computability results, and that the theory is embedded smoothly into classical measure theory.
61 citations
TL;DR: Different concrete models for computing in topological algebras are considered and their mutual equivalence in certain commonly occurring circumstances are proved, evidence that computability theory for topologicalAlgebra is a stable theory independent of the specific models of computation.
61 citations
Book•
01 Jan 1994
TL;DR: In this chapter, the author examines the role of symbols in the development of logic, and some examples from the literature show the role that notation and basic theory have played in this development.
Abstract: Introduction. 1: Notation and basic theory. 2: Reduction. 3: Combinatory logic. 4: Semantics. 5: Computability. 6: Types. 7: Practical issues. 8: Other calculi. 9: Further reading. Bibliography. Index
61 citations
Book•
19 Dec 1991
TL;DR: This textbook presents an introduction to the theory of automata and to their connections with the study of languages.
Abstract: From the Publisher:
Theoretical models of simple computing machines, known as automata, play a central role in theoretical computer science. This textbook presents an introduction to the theory of automata and to their connections with the study of languages.
60 citations
TL;DR: An attempt is made to lay a basis for a general, unified, concise, and simple theory of computable and continuous functions from F to F or N, where F = {f: N → N }
60 citations