This introduction to the theory of pseudorandomness offers a fresh perspective on the concept of randomness, rooted in a complexity-theoretic approach. At its core, this approach posits that a distribution is considered random (or pseudorandom) if no efficient procedure can distinguish it from the uniform distribution.
[Read More]
Computability and complexity from a programming perspective by Neil Jones (2022)
Computability and complexity theory should be focal points for both practitioners and theorists. Regrettably, the field is often considered challenging to navigate. Neil Jones seeks to bridge the gap between computability and complexity theory and other realms of computer science, particularly programming.
[Read More]
Automata And Computability by Dexter Kozen (1997)
This textbook aims to offer undergraduate students an introduction to the fundamental theoretical models of computability, delving into the diverse and intricate structure of these models. It caters to students with some background in elementary discrete mathematics, presenting a well-paced initial course with additional chapters introducing more advanced concepts.
[Read More]
Introduction to the theory of computation. Solution manual by Michael Sipser (2012)
Solutions manual to a highly anticipated revision builds upon the strengths of the previous edition. Sipser’s candid, crystal-clear style allows students at every level to understand and enjoy this field. His innovative “proof idea” sections explain profound concepts in plain English.
[Read More]
Kolmogorov Complexity and Computational Complexity by Osamu Watanabe (1992)
The mathematical theory of computation has given rise to two significant approaches to the informal concept of “complexity.” Kolmogorov complexity, typically used as a measure for a single object like a string or sequence, assesses the information required to describe the object.
[Read More]
The Universal history of computing, from abascus to quantum computer by Georges Ifrah (2000)
Praised as a captivating compilation of information on writing systems, encompassing both words and numbers, The Universal History of Computing receives acclaim from Publishers Weekly. Booklist deems it a truly enlightening and fascinating study for readers inclined toward mathematics.
[Read More]
Theory of Computing. A Gentle Introduction by Efim Kinber (2001)
This book focuses on fundamental issues of computation. The readers can master the content and gain lasting perspective from which to understand computers by carefully worked out examples, illustrations, and algorithmic proofs.
[Read More]
Algorithms for Interviews by Adnan Aziz (2011)
Algorithms For Interviews (AFI) is designed to assist engineers preparing for software development interviews, as well as those conducting the interviews. AFI comprises 174 meticulously solved algorithm design problems encompassing a range of topics.
[Read More]
Theory of Computation Lecture Notes by Abhijat Vichare (2006)
The lectures on computation offer a comprehensive exploration into the theoretical and practical aspects of computational processes. Delivered by seasoned experts in the field, these sessions provide an in-depth understanding of fundamental computational concepts, algorithms, and data structures.
[Read More]
Discrete Mathematics and Its Applications (5e) by Kenneth H. Rosen
solutions manual
“Discrete Mathematics and Its Applications” by Kenneth H. Rosen is a highly regarded textbook that serves as an excellent introduction to the fundamental concepts of discrete mathematics. Now in its fifth edition, this book continues to be a valuable resource for students studying computer science, mathematics, engineering, and related fields.
[Read More]