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… (More)
Wikipedia

Related topics

Related topics

49 relations
Abstract machineAlgorithmAndrzej GrzegorczykAutomata theory
(More)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2000
Highly Cited
2000
Computing with Membranes
We introduce a new computability model, of a distributed parallel type, based on the notion of a membrane structure. Such a… (More)
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1999
Highly Cited
1999
The topological structure of asynchronous computability
We give necessary and su cient combinatorial conditions characterizing the tasks that can be solved by asynchronous processes, of… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 7
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Automata and Computability
ion The machine models mentioned above were first identified in the same way that theories in physics or any other scientific… (More)
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Computability with Low-Dimensional Dynamical Systems
Koiran P., Cosnard M. and Garzon M., Computability with low-dimensional dynamical systems, Theoretical Computer Science 132 (1994… (More)
Is this relevant?
Highly Cited
1991
Highly Cited
1991
Turing Computability with Neural Nets
This paper shows the existence of a finite neural network, made up of sigmoidal nenrons, which simulates a nniversal Turing… (More)
Is this relevant?
Highly Cited
1989
Highly Cited
1989
Computability in analysis and physics
Let's read! We will often find out this sentence everywhere. When still being a kid, mom used to order us to always read, so did… (More)
Is this relevant?
Highly Cited
1969
Highly Cited
1969
Theory of Recursive Functions and Effective Computability
No wonder you activities are, reading will be always needed. It is not only to fulfil the duties that you need to finish in… (More)
Is this relevant?
Highly Cited
1958
Highly Cited
1958
Computability and Unsolvability
computability and unsolvability. Book lovers, when you need a new book to read, find the book here. Never worry not to find what… (More)
Is this relevant?
Highly Cited
1937
Highly Cited
1937
Computability and λ-Definability
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org… (More)
Is this relevant?
Highly Cited
1937
Highly Cited
1937
On computable numbers, with an application to the Entscheidungsproblem
The "computable" numbers may be described briefly as the real numbers whose expressions as a decimal are calculable by finite… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?