Science
Science: physics, biology, chemistry, astronomy and space, neuroscience, and research explained.
-
Comprehensive Mathematics for Computer Scientists springer.com
A series dedicated to math topics and their relevance to computer science.
-
Floyd & Bokulich. Philosophical Explorations of the Legacy of Alan Turing: Turing 100 springer.com
Turing’s place in the history and philosophy of science.
-
Makinson. Sets, Logic and Maths for Computing springer.com
It presents a careful selection of the material most needed by students in their first two years studying computer science.
-
Vince. Foundation Mathematics for Computer Science: A Visual Approach springer.com
A range of mathematical topics to provide a solid foundation for an undergraduate course in computer science, starting with a review of number systems and their relevance to digital computers, and finishing with differential and integral calculus.
-
Yves Nievergelt. Logic, Mathematics, and Computer Science: Modern Foundations with Practical Applications springer.com
For lower undergraduates, It introduces the reader to logic, proofs, sets, and number theory, Focusing on foundations. It provides complete details and derivations of formal proofs.
-
Ben-Ari. Mathematical Logic for Computer Science springer.com
Semantic tableaux are used because they are theoretically sound and easy to understand.
-
Simons' Institute simons.berkeley.edu
Programs, Events, and workshops, that aim toward maximizing impact and engagement across the theoretical computer science community.
-
Part I scottaaronson.com
& Part II - Part I: Presuppose only linear algebra and a bit of classical algorithms. Topics include quantum circuits, density matrices, entanglement entropy, Wiesner’s quantum money, QKD, quantum teleportation, the Bell inequality, interpretations of QM, the Shor 9-qubit code…
-
Atallah & Blanton. Algorithms and Theory of Computation Handbook: Special Topics and Techniques routledge.com
A complete comprehensive encyclopediac handbook which surveys all related areas to theoretical computer science.
-
Atallah & Blanton. Algorithms and Theory of Computation Handbook: General Concepts and Techniques routledge.com
A complete comprehensive encyclopediac handbook which surveys all related areas to theoretical computer science.
-
Lipton & Regan rjlipton.wpcomstaging.com
A list of theory blogs for computer science.
-
Aharonov & Vazirani, Is Quantum Mechanics Falsifiable? A Computational Perspective on the Foundations of Quantum… researchgate.net
It describes how quantum mechanics can be tested in the limit of high complexity regime by extending the usual scientific paradigm to include.
-
TCS Subreddit reddit.com
Theoretical computer science's subreddit.
-
Building Bridges I rd.springer.com
, Building Bridges II, Fete of Combinatorics and Computer Science - Collected works in celebration of Laszlo Lovasz, Connecting discrete math with computer science.
-
Stanford Encyclopedia of Philosophy. Computational Complexity Theory plato.stanford.edu
The foundations of complexity theory, and its potential significance on philosophy of computer science, philosophy of mathematics and epistemology.
-
Knuth, Graham & Patashnik. Concrete Mathematics: A Foundation for Computer Science pearson.com
An expansion of the Mathematical Preliminaries section in Knuth's classic Art of Computer Programming, but the style of presentation is more leisurely, and individual topics are covered more deeply.
-
Omer Reingold. The Practice of Theory Research omereingold.wordpress.com
A research methods course, concentrating on the how rather than the what. It focuses on research practices common for computer science theory research.
-
Demaine, Abel & Chapman. Mathematics for Computer Science ocw.mit.edu
A junior introduction to discrete mathematics for computer scientists. - Companion Textbook 2015
-
Kelner. Topics in Theoretical Computer Science: An Algorithmist's Toolkit. MIT ocw.mit.edu
It covers a collection of geometric techniques that apply broadly in modern algorithm design.
-
Foundations and Trends in Theoretical Computer Science nowpublishers.com
It provides monographs written by leaders that give tutorial coverage of subjects, research retrospectives as well as survey papers that offer state-of-the-art reviews fall within the scope of the journal.
-
Moore & Mertens. The Nature of Computation nature-of-computation.org
It spans complexity of mazes and games; optimization in theory and practice; randomized algorithms, interactive proofs, and pseudorandomness; Markov chains and phase transitions; and of quantum computing. It provides accessible explanations
-
Handbook of Theoretical Computer Science. Volume A: Algorithms and Complexity mitpress.mit.edu
A complete comprehensive encyclopediac handbook which surveys all related areas to theoretical computer science.
-
Handbook of Theoretical Computer Science. Volume B: Formal Methods and Semantics mitpress.mit.edu
A complete comprehensive encyclopediac handbook which surveys all related areas to theoretical computer science.
-
Harry Lewis. Ideas That Created the Future: Classic Papers of Computer Science mitpress.mit.edu
Classic papers by thinkers ranging from Aristotle and Leibniz to Norbert Wiener and Gordon Moore that chart the evolution of computer science.
-
Paluszynski. Calculus for Computer Scientists math.uni.wroc.pl
calculus lecture notes taught for undergrad computer science students
-
Wigderson. Mathematics and Computation: A Theory Revolutionizing Technology and Science math.ias.edu
A sweeping survey of complexity theory, emphasizing the field’s insights and challenges. It explains the ideas and motivations leading to key models, notions, and results.
-
Eck & Critchlow. Foundations of Computation math.hws.edu
for a one-semester course in theoretical computer science. It has no prerequisites other than introductory computer programming. It includes logic, sets, and function from discrete math, and automata, formal languages, and grammar from upper-level courses.
-
Krantz. Handbook of Logic and Proof Techniques for Computer Science maa.org
A concise offered as an accessible reference on mathematical logic for the professional computer scientist.
-
Dijkstra. The Three Golden Rules for Successful Scientific Research link.springer.com
A note devoted to three rules that must be followed if you want to be successful in scientific research.
-
Ausiello. The Making of a New Science: A Personal Journey Through the Early Years of Theoretical Computer Science link.springer.com
A story about people, pioneers with diverse backgrounds and characters who established a new field.
-
Lacona. LOGIC: Lecture Notes for Philosophy, Mathematics, and Computer Science link.springer.com
Suitable for undergraduate introductions to logic and early graduate courses on logic.
-
Barak. Introduction to TCS introtcs.org
A modern, brief, and accessible text which introduces theoretical computer science for undergrads. It includes topics not usually included in standard undergrad text-books.
-
Aho & Ullman. Foundations of Computer Science i.stanford.edu
A classic math-oriented introduction to computer science.
-
Henry Yuen. The Complexity of Entanglement. Fall 2020 henryyuen.net
Focuses on cutting edge topics in quantum information that relate to Complexity of Entanglement. - see this class also
-
SIGACT News dl.acm.org
ACM's official theoretical computer science news feed.
-
Deutsch. The Fabric of Reality: The Science of Parallel Universes and Its Implications daviddeutsch.org.uk
The Fabric of Reality presents a startlingly integrated, rational and optimistic world view – the result of taking seriously the deepest ideas of modern science and the philosophy of science.
-
TCS Stack Exchange cstheory.stackexchange.com
Research-oriented Q&A of theoretical computer science.
-
Aspnes. Notes on Discrete Mathematics cs.yale.edu
Fall 2017 of the Yale course CPSC 202a, Mathematical Tools for Computer Science.
-
-
Arora. The Computational Universe cs.princeton.edu
Takes us on a broad sweep of scientific knowledge and related technologies: propositional logic of the ancient Greeks (microprocessors); quantum mechanics (silicon chips); network and system phenomena (internet and search engines); computational intractability (secure…
-
Arora. Thinking Like a Theorist. Princeton cs.princeton.edu
It covers a large number of the math/CS topics that you need to know for reading and doing research in Computer Science Theory.
-
Arora. A Theorist's Toolkit. Princeton cs.princeton.edu
Aimed primarily at first and second year graduate students who plan to do research in theoretical computer science. We will introduce probabilistic, algebraic, combinatorial, and algorithmic methods useful in proofs.
-
Koutsoupias. Probability and Computing. Oxford cs.ox.ac.uk
Introduction to probabilistic methods in computer science.
-
O'Donnell. A Theorist's Toolkit. CMU cs.cmu.edu
It covers a large number of the math/CS topics that you need to know for reading and doing research in Computer Science Theory.
-
Introduction to Discrete Mathematics for Computer Science. UC San-Diego coursera.org
Learn the language of Computer Science. Learn the math that defines computer science, and practice applying it through mathematical proofs and Python code.
-
Cambridge Foundations of CS cl.cam.ac.uk
It teaches programming and presents some fundamental principles of computer science, especially algorithm design.
-
Apt & Grädel. Lectures in Game Theory for Computer Scientists cambridge.org
Games provide mathematical models for interaction, and numerous tasks in computer science can be formulated in game-theoretic terms.
-
Tu Delft. Delftse Foundations of Computation books.open.tudelft.nl
A textbook for a one quarter introductory course in theoretical computer science including logic, proof techniques, and set theory. It assumes no prerequisite other than basic programming.
-
Aaronson. Quantum Computing Since Democritus assets.cambridge.org
It covers an amazing array of topics. Beginning in antiquity with Democritus, it progresses through logic and set theory,computability and complexity theory, quantum computing, cryptography, the information content of quantum states, and the interpretation of quantum mechanics.
-
Rudich & Wigderson. Computational Complexity Theory ams.org
Three weeks of lectures from the IAS/Park City Mathematics Institute Summer School on computational complexity. Topics include reductions, lower-bounds, average-case complexity, randomness, interactive proof systems, probabilistically checkable proofs, quantum computing, and…
- next page of items loading…
