In this book, which was originally published in 1985, Arto Salomaa
gives an introduction to certain mathematical topics central to
theoretical computer science: computability and recursive
functions, formal languages and automata, computational complexity
and cryptography. Without sacrificing readability, the presentation
is essentially self-contained, with detailed proofs of all
statements provided. Professor Salomaa is well known for his books
in this area. The present work provides an insight into the basics,
together with explanations of some of the more important
developments in the field.
General
Imprint: |
Cambridge UniversityPress
|
Country of origin: |
United Kingdom |
Series: |
Encyclopedia of Mathematics and its Applications |
Release date: |
April 2011 |
First published: |
March 2011 |
Authors: |
Arto Salomaa
|
Dimensions: |
234 x 156 x 16mm (L x W x T) |
Format: |
Paperback - Trade
|
Pages: |
300 |
ISBN-13: |
978-0-521-17733-7 |
Categories: |
Books >
Science & Mathematics >
Mathematics >
Probability & statistics
|
LSN: |
0-521-17733-2 |
Barcode: |
9780521177337 |
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!