Nicht aus der Schweiz? Besuchen Sie lehmanns.de
Measuring Power of Algorithms, Programs & Automata - Mark Burgin

Measuring Power of Algorithms, Programs & Automata

(Autor)

Buch | Hardcover
346 Seiten
2009
Nova Science Publishers Inc (Verlag)
978-1-60692-381-8 (ISBN)
CHF 229,95 inkl. MwSt
  • Versand in 10-20 Tagen
  • Versandkostenfrei
  • Auch auf Rechnung
  • Artikel merken
Computers, their software and their networks are among the most complicated systems of our time. Science is the only efficient tool for dealing with this overwhelming complexity. One of the methodologies developed in science is the axiomatic approach. This book developes an axiomatic approach in computer science.
We are living in a world where complexity of systems created and studied by people grows beyond all imaginable limits. Computers, their software and their networks are among the most complicated systems of our time. Science is the only efficient tool for dealing with this overwhelming complexity. One of the methodologies developed in science is the axiomatic approach. It proved to be very powerful in mathematics. In this book, the authors developed further an axiomatic approach in computer science initiated by Floyd, Manna, Blum and other researchers. In the traditional constructive setting, different classes of algorithms (programs, processes or automata) are studied separately, with some indication of relations between these classes. In such a way, the constructive approach gave birth to the theory of Turing machines, theory of partial recursive functions, theory of finite automata, and other theories of constructive models of algorithms. The axiomatic context allows one to research collections of classes of algorithms, automata, and processes. These classes are united in a collection by common properties in a form of axioms. As a result, axiomatic approach goes higher in the hierarchy of computer and network models, reducing in such a way complexity of their study.

Preface; Introduction; Algorithms, Programs, Procedures, and Abstract Automata; Functioning of Automata and Algorithms; Basic Axioms for Algorithms; Power of Algorithms: Comparison and Evaluation; Problems and Related Properties of Algorithms; Boundaries for Algorithms and Computation; Software and Hardware Verification and Testing; Conclusion; Index.

Erscheint lt. Verlag 7.1.2009
Zusatzinfo Illustrations
Verlagsort New York
Sprache englisch
Maße 260 x 180 mm
Gewicht 760 g
Themenwelt Informatik Theorie / Studium Algorithmen
ISBN-10 1-60692-381-1 / 1606923811
ISBN-13 978-1-60692-381-8 / 9781606923818
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
IT zum Anfassen für alle von 9 bis 99 – vom Navi bis Social Media

von Jens Gallenbacher

Buch | Softcover (2021)
Springer (Verlag)
CHF 41,95
Interlingua zur Gewährleistung semantischer Interoperabilität in der …

von Josef Ingenerf; Cora Drenkhahn

Buch | Softcover (2023)
Springer Fachmedien (Verlag)
CHF 46,15