0
Your cart

Your cart is empty

Books > Computing & IT > General theory of computing > Data structures

Buy Now

Measuring Power of Algorithms, Programs & Automata (Hardcover) Loot Price: R2,386
Discovery Miles 23 860
Measuring Power of Algorithms, Programs & Automata (Hardcover): Mark Burgin

Measuring Power of Algorithms, Programs & Automata (Hardcover)

Mark Burgin

 (sign in to rate)
Loot Price R2,386 Discovery Miles 23 860 | Repayment Terms: R224 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 working days

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.

General

Imprint: nova science publishers
Country of origin: United States
Release date: 2009
Authors: Mark Burgin
Dimensions: 180 x 260 x 25mm (L x W x T)
Format: Hardcover
Pages: 346
ISBN-13: 978-1-60692-381-8
Categories: Books > Computing & IT > General theory of computing > Data structures
Books > Computing & IT > Computer programming > Algorithms & procedures
Promotions
LSN: 1-60692-381-1
Barcode: 9781606923818

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

You might also like..

Reachable Sets of Dynamic Systems…
Stanislaw Raczynski Paperback R3,927 Discovery Miles 39 270
Comprehensive Metaheuristics…
S. Ali Mirjalili, Amir Hossein Gandomi Paperback R3,956 Discovery Miles 39 560
MATLAB Applications in Engineering
Constantin Volosencu Hardcover R3,055 Discovery Miles 30 550
The Application of Ant Colony…
Ali Soofastaei Hardcover R2,553 Discovery Miles 25 530
Introduction to Chemical Engineering…
Henry C. Foley Paperback R3,120 Discovery Miles 31 200
Python Programming for Computations…
Computer Language Hardcover R1,120 R949 Discovery Miles 9 490
Coding for Kids in Python - Python…
Bob Mather Hardcover R851 Discovery Miles 8 510
Gamma Solution - An Application of…
James R Warren Hardcover R1,232 R1,048 Discovery Miles 10 480
C Programming - C Programming Language…
Adam Dodson Hardcover R551 R505 Discovery Miles 5 050
The Physics of Computing
Marilyn Wolf Paperback R1,645 Discovery Miles 16 450
Genetic Algorithms with Python
Clinton Sheppard Hardcover R856 R812 Discovery Miles 8 120
GPU-based Parallel Implementation of…
Ying Tan Paperback R2,065 Discovery Miles 20 650

See more

Partners