- Author:
- Bernard M. Moret
From the Publisher: Highlights: Motivates theoretical developments by connecting them to practical issues. Introduces every result and proof with an informal overview to build intuition. Introduces models through finite automata, then builds to universal models, including recursion theory. Emphasizes complexity theory, beginning with a detailed discussion of resource use in computation. Includes large numbers of examples and illustrates abstract ideas through diagrams Gives informal presentations of difficult recent results with profound implications for computing.
Cited By
- Zheng X, Zhu S, Gao J and Mamitsuka H Instance-wise weighted nonnegative matrix factorization for aggregating partitions with locally reliable clusters Proceedings of the 24th International Conference on Artificial Intelligence, (4091-4097)
Ibáñez J and Sánchez A (2009). Constructive reduction, ACM SIGCSE Bulletin, 41:2, (90-94), Online publication date: 25-Jun-2009.- Ziegler M and Koolen W (2008). Kolmogorov Complexity Theory over the Reals, Electronic Notes in Theoretical Computer Science (ENTCS), 221, (153-169), Online publication date: 1-Dec-2008.
- Rosenberg A State Theoretical Computer Science, (375-398)
- Li T, Ogihara M and Ma S On combining multiple clusterings Proceedings of the thirteenth ACM international conference on Information and knowledge management, (294-303)
Recommendations
Practical Theory of Computation on Structures
Theoretical Aspects of Software EngineeringAbstractThere are hardly two fields in Computer Science that are further apart than Software Engineering and Theoretical Computer Science. The lack of theoretical foundations in the field of Software Engineering has a counterpart, as the theoretical ...