Computability - Couverture souple

 
9786130205133: Computability
Couverture souple
ISBN 10 : 6130205139 ISBN 13 : 9786130205133
Editeur : Alphascript Publishing, 2010

Synopsis

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. The most widely-studied form of computability is Turing computability, which is computability via a Turing machine. However, many other forms of computability are studied as well. Computability notions weaker than Turing machines are studied in automata theory, while computability notions stronger than Turing machines are studied in the field of hypercomputation. Apart from the bare question of what problems can be effectively solved, computer scientists are also interested in the resources, such as time and memory, that are required to solve problems using different models of computation. Models of parallel computation, for example, are of interest for their speed of computation, even though any problem solvable by parallel computation is also solvable by non-parallel computation. The field of computational complexity theory is devoted to the study of the resources used during computations.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

Présentation de l'éditeur

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. The most widely-studied form of computability is Turing computability, which is computability via a Turing machine. However, many other forms of computability are studied as well. Computability notions weaker than Turing machines are studied in automata theory, while computability notions stronger than Turing machines are studied in the field of hypercomputation. Apart from the bare question of what problems can be effectively solved, computer scientists are also interested in the resources, such as time and memory, that are required to solve problems using different models of computation. Models of parallel computation, for example, are of interest for their speed of computation, even though any problem solvable by parallel computation is also solvable by non-parallel computation. The field of computational complexity theory is devoted to the study of the resources used during computations.

Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.

Éditeur
Alphascript Publishing
Date d'édition
2010
Langue
anglais
ISBN 10 
6130205139
ISBN 13 
9786130205133
Reliure
Broché
Nombre de pages
108
Éditeur
Miller Frederic P., Vandome Agnes F., McBrewster John
Coordonnées du fabricant
non disponible
Personne responsable
non disponible