Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Search
  Browse All Reviews > Theory Of Computation (F) > General (F.0)  
 
Options:
 
  1-10 of 47 Reviews about "General (F.0)": Date Reviewed
  Uncertainty management with fuzzy and rough sets: recent advances and applications
Bello R., Falcon R., Verdegay J., Springer International Publishing, New York, NY, 2019. 413 pp.  Type: Book (978-3-030104-62-7)

This volume contains papers presented at the Second International Symposium on Fuzzy and Rough Sets (ISFUROS 2017). The symposium drew 55 submissions; 30 were accepted for presentation. Extended versions of 20 accepted papers are inclu...

Jun 3 2021
  Model selection and error estimation in a nutshell
Oneto L., Springer International Publishing, New York, NY, 2020. 132 pp.  Type: Book (978-3-030243-58-6)

The “learning” in machine learning involves the acquisition of a model that reflects the behavior or the functionality behind some dataset. Since there are so many techniques (called classifiers) to process data and...

Jan 27 2021
   Essential logic for computer science
Page R., Gamboa R., The MIT Press, Cambridge, MA, 2018. 304 pp.  Type: Book (978-0-262039-18-5)

The “for computer science” part of this excellent book’s title initially gave me pause, as it connoted for me a possible compromise of the “logic” part. As a matter of fact, the very op...

Oct 2 2020
  Hierarchies in inclusion logic with lax semantics
Hannula M. ACM Transactions on Computational Logic 19(3): 1-23, 2018.  Type: Article

A natural interest of computational logic is to investigate decidable subsets of first-order logic. One such subset is the formalism of inclusion logic (FOI), introduced by Galliani as an evolution of dependence logic [1], which invest...

Oct 1 2020
  What can be computed?: A practical guide to the theory of computation
MacCormick J., PRINCETON UNIVERSITY PRESS, Princeton, NJ, 2018. 408 pp.  Type: Book (978-0-691170-66-4), Reviews: (2 of 2)

Teaching the theory of computation and complexity is tough. It is especially challenging for those ambitious teachers who wish to provide more than just the basic data that programmers ought to know. In fact, the basic data is quite a ...

May 1 2019
  The digital and the real world: computational foundations of mathematics, science, technology, and philosophy
Mainzer K., World Scientific Publishing Co Pte Ltd, Singapore, 2018. 472 pp.  Type: Book

The digital and the real world is a quite unique text that goes beyond the common clichés of describing digitalization as a global phenomenon. Instead, the book investigates the complex relationships between continuous ...

Mar 22 2019
   What can be computed?: A practical guide to the theory of computation
MacCormick J., PRINCETON UNIVERSITY PRESS, Princeton, NJ, 2018. 408 pp.  Type: Book (978-0-691170-66-4), Reviews: (1 of 2)

What should be in a first course on the theory of computation? For 50 years, there has only been one answer: formal grammars and their corresponding automata. Hopcroft and Ullman’s book has been the standard [1], but there ar...

Feb 21 2019
  From hidden to visible
Zhang M., Ogata K. Theoretical Computer Science 722(C): 52-75, 2018.  Type: Article

Algebraic specification is a technique in which a system is modeled by equations or conditional equations. This approach was originally used for defining data types and operations on them. An added benefit is that the equational system...

Oct 12 2018
  From computing to computational thinking
Wang P., Chapman & Hall/CRC, Boca Raton, FL, 2015. 288 pp.  Type: Book (978-1-482217-65-0)

This is a nice book, one that I will keep near me, next to Manfred Schroeder’s Fractals, chaos, power laws [1] and Mark Levi’s The mathematical mechanic [2]....

Jan 3 2017
  Matrix calculus for classical and quantum circuits
De Vos A., De Baerdemacker S. ACM Journal on Emerging Technologies in Computing Systems 11(2): 1-11, 2014.  Type: Article

Excepting the final measurement, quantum computations are reversible computations. Quantum computers are infamously hard to construct, but reversible computers are easy (by seminal results of Toffoli). This paper aims to rigorously est...

Dec 17 2014
 
 
 
Display per page
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 2004 Reviews.com™
Terms of Use
| Privacy Policy