Search
Feedback
About UniCat 
Help
News
| Listing 1 - 2 of 2 |
Sort by
|
ISBN: 131608681X 1107090695 1107087589 1107099854 1107093821 1107325633 9781107087583 9781107325630 0521302455 9780521302456 9780521177337 Year: 1985 Volume: v. 25 Publisher: Cambridge [Cambridgeshire] ; New York : Cambridge University Press,
Abstract | Keywords | Export | Availability | Bookmark
Loading...Choose an application
- Reference Manager
- EndNote
- RefWorks (Direct export to RefWorks)
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.
Computable functions. --- Computational complexity. --- Sequential machine theory. --- Finite automata --- Finite state machines (Machine theory) --- Machine theory --- Electronic digital computers --- Complexity, Computational --- Electronic data processing --- Computability theory --- Functions, Computable --- Partial recursive functions --- Recursive functions, Partial --- Constructive mathematics --- Decidability (Mathematical logic)
ISBN: 0521302455 9780521302456 Year: 1985 Volume: v. 25 Publisher: Cambridge: Cambridge university press,
Abstract | Keywords | Export | Availability | Bookmark
Loading...Choose an application
- Reference Manager
- EndNote
- RefWorks (Direct export to RefWorks)
Computational complexity --- Sequential machine theory --- Computable functions --- Computable functions. --- Computational complexity. --- Sequential machine theory. --- Computer science --- 519.6 --- 681.3 --- 519.6 Computational mathematics. Numerical analysis. Computer programming --- Computational mathematics. Numerical analysis. Computer programming --- Finite automata --- Finite state machines (Machine theory) --- Machine theory --- Electronic digital computers --- Complexity, Computational --- Electronic data processing --- Computability theory --- Functions, Computable --- Partial recursive functions --- Recursive functions, Partial --- Constructive mathematics --- Decidability (Mathematical logic) --- Computerwetenschap --- Fonctions calculables --- Complexité de calcul (Informatique) --- Théorie des machines séquentielles --- 681.3* / / / / / / / / / / / / / / / / / / / / / / / / / / / /
| Listing 1 - 2 of 2 |
Sort by
|