Skip to search formSkip to main contentSkip to account menu

Computability

Known as: Computable, Calculatable, Calculably 
Computability is the ability to solve a problem in an effective manner. It is a key topic of the field of computability theory within mathematical… 
Wikipedia (opens in a new tab)

Related topics

Related topics

49 relations
Abstract machineAlgorithmAndrzej GrzegorczykAutomata theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2009
Highly Cited
2009
Computability and randomness
The interplay between computability and randomness has been an active area of research in recent years, reflected by ample… 
Highly Cited
2000
Highly Cited
2000
Computing with Membranes
  • G. Paun
  • J. Comput. Syst. Sci.
  • 2000
  • Corpus ID: 15761839
We introduce a new computability model, of a distributed parallel type, based on the notion of a membrane structure. Such a… 
Highly Cited
1999
Highly Cited
1999
The topological structure of asynchronous computability
We give necessary and sufficient combinatorial conditions characterizing the tasks that can be solved by asynchronous processes… 
Highly Cited
1997
Highly Cited
1997
Automata and Computability
  • D. Kozen
  • Undergraduate Texts in Computer Science
  • 1997
  • Corpus ID: 6556008
From the Publisher: This introduction to the basic theoretical models of computability develops their rich and varied structure… 
Highly Cited
1989
Highly Cited
1989
Computability in analysis and physics
This book represents the first treatment of computable analysis at the graduate level within the tradition of classical… 
Highly Cited
1974
Highly Cited
1974
Computability and logic
Part I. Computability Theory: 1. Enumerability 2. Diagonalization 3. Turing computability 4. Uncomputability 5. Abacus… 
Highly Cited
1969
Highly Cited
1969
Theory of Recursive Functions and Effective Computability
If searching for the ebook by Hartley Rogers Theory of Recursive Functions and Effective Computability in pdf format, then you've… 
Highly Cited
1969
Highly Cited
1969
Theory of Recursive Functions and Effective Computability
Central concerns of the book are related theories of recursively enumerable sets, of degree of un-solvability and turing degrees… 
Highly Cited
1958
Highly Cited
1958
Computability and Unsolvability
  • Martin D. Davis
  • McGraw-Hill Series in Information Processing and…
  • 1958
  • Corpus ID: 32008469
Only for you today! Discover your favourite computability and unsolvability book right here by downloading and getting the soft… 
Highly Cited
1937
Highly Cited
1937
Computability and λ-definability
  • A. Turing
  • Journal of Symbolic Logic
  • 1937
  • Corpus ID: 2317046
Several definitions have been given to express an exact meaning corresponding to the intuitive idea of ‘effective calculability… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)