Search
for Topics
All Reviews
Browse All Reviews
>
Theory Of Computation (F)
>
Computation By Abstract Devices (F.1)
> General (F.1.0)
Options:
All Media Types
Journals
Proceedings
Div Books
Whole Books
Other
Date Reviewed
Title
Author
Publisher
Published Date
Descending
Ascending
110 of 20 Reviews about "
General (F.1.0)
":
Date Reviewed
Turing machine universality of the game of life
Rendell P., Springer Publishing Company, Incorporated, New York, NY, 2015. 177 pp. Type: Book (9783319198415)
Since it was invented by John Conway and popularized in Martin Gardner’s “Mathematical Games” column in
Scientific American
in 1970 [1], the Game of Life (GoL) has held a special fascination for fan...
Nov 30 2015
Limits of computation: an introduction to the undecidable and the intractable
Reiter E., Johnson C., Chapman & Hall/CRC, Boca Raton, FL, 2013. 279 pp. Type: Book (9781439882061), Reviews: (2 of 2)
Reiter and Johnson have produced an excellent but “gentle introduction to the theory of computational complexity,” as they put it. This gentleness is entirely appropriate, given the notoriously nuanced, seemingly im...
Jun 24 2013
Limits of computation: an introduction to the undecidable and the intractable
Reiter E., Johnson C., Chapman & Hall/CRC, Boca Raton, FL, 2013. 279 pp. Type: Book (9781439882061), Reviews: (1 of 2)
This book is a highly accessible introduction to the theory of computation. It aims to educate the reader on the most fundamental aspects of algorithms and computation. It deals with two big questions: Which problems admit no algorithm...
Apr 19 2013
Theory of computation
Tourlakis G., Wiley Publishing, Hoboken, NJ, 2012. 416 pp. Type: Book (9781118014783)
Like other works I’ve encountered by this author [1,2,3], this book is characterized by consummate logicomathematical rigor, coupled with commensurate expository and pedagogical merit. Rigor is certainly a necessary attribut...
Apr 8 2013
Proofs and algorithms: an introduction to logic and computability
Dowek G., Springer Publishing Company, Incorporated, New York, NY, 2011. 195 pp. Type: Book (9780857291202)
Mathematical logic is a challenging subject for many students. While its results are of critical importance to computer scientists, its experts often struggle to convey its main ideas to a lay audience. At first glance, this book, with...
Feb 6 2012
Elements of computation theory
Singh A., Springer Publishing Company, Incorporated, New York, NY, 2009. 422 pp. Type: Book (9781848824966), Reviews: (2 of 2)
This book gathers the essential parts of computability theory that typically comprise undergraduatelevel courses. While the topics are considered elements of computation theory, most of the chapters cover formal language theory. Thus,...
Jan 13 2010
Elements of computation theory
Singh A., Springer Publishing Company, Incorporated, New York, NY, 2009. 422 pp. Type: Book (9781848824966), Reviews: (1 of 2)
This undergraduate textbook is designed for a course on the foundations of computer science (CS). Teaching such a course can be a challenging enterprise. Many students believe that what they learn in such a foundational course has noth...
Oct 19 2009
Fastest parallel molecular algorithms for the elliptic curve discrete logarithm problem over
GF
(2
^{n}
)
Iaccarino G., Mazza T. BADS 2009 (Proceedings of the 2009 Workshop on Bioinspired Algorithms for Distributed Systems, Barcelona, Spain, Jun 19, 2009) 95104, 2009. Type: Proceedings
Iaccarino and Mazza study, in this paper, the use of DNAbased computers for the computation of discrete logarithms on elliptic curves, defined over finite fields of characteristic 2....
Sep 3 2009
Leveraging applications of formal methods: First International Symposium, ISoLA 2004, Paphos, Cyprus, October 30  November 2, 2004, Revised Selected Papers (Lecture Notes in Computer Science 4313)
Maragria T., Steffen B., SpringerVerlag New York, Inc., Secaucus, NJ, 2006. 197 pp. Type: Book (9783540489283)
The practical applications of formal methods are increasing. This book contains the main proceedings of an international symposium on leveraging applications of formal methods (IsoLA). It consists of 12 papers....
Aug 17 2007
Automata theory with modern applications
Anderson J., Cambridge University Press, New York, NY, 2006. 260 pp. Type: Book (9780521613248), Reviews: (2 of 2)
Automata theory is the branch of the theory of computation concerned with the study of abstract computing devices. Automata theory came into existence even before computers were invented. Finite automata are useful for modeling many ki...
Jun 5 2007
Display
5
10
15
25
50
100
per page
Reproduction in whole or in part without permission is prohibited. Copyright 19992024 ThinkLoud
^{®}
Terms of Use

Privacy Policy