Computability is the ability to solve a problem in an effective manner. It is studied through models such as Turing-computable and μ-recursive functions, lambda calculus, automata theory, and hypercomputation. These models have varying levels of computational power.

UC Berkeley

Fall 2022

CS 70 presents key ideas from discrete mathematics and probability theory with emphasis on their application in Electrical Engineering and Computer Sciences. It addresses a variety of topics such as logic, induction, modular arithmetic, and probability. Sophomore mathematical maturity and programming experience equivalent to an Advanced Placement Computer Science A exam are prerequisites.

No concepts data

+ 32 more conceptsCarnegie Mellon University

Spring 2023

This course provides an initial dive into complexity theory, exploring computations bound by resources like time, space, and energy. Emphasis is placed on low complexity classes.

No concepts data

+ 29 more concepts