Computability: Computability theory, Computer science, Mathematical logic, Turing machine, Automata theory, Hypercomputation, Computational complexity theory, Parallel computing, Halting problem - Softcover

 
9786130205133: Computability: Computability theory, Computer science, Mathematical logic, Turing machine, Automata theory, Hypercomputation, Computational complexity theory, Parallel computing, Halting problem
Softcover
ISBN 10: 6130205139 ISBN 13: 9786130205133
Verlag: Alphascript Publishing, 2010

Inhaltsangabe

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.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.

Reseña del editor

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.

„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.

Verlag
Alphascript Publishing
Erscheinungsdatum
2010
Sprache
Englisch
ISBN 10 
6130205139
ISBN 13 
9786130205133
Einband
Tapa blanda
Anzahl der Seiten
108
Herausgeber
Miller Frederic P., Vandome Agnes F., McBrewster John
Kontakt zum Hersteller
Nicht verfügbar
Verantwortliche Person
Nicht verfügbar