by Skillo StaffNP-completeness describes a class of problems that are hard to solve but whose solutions are easy to verify, central to a famous open question. This guide explains it.
by Skillo StaffSet theory is the branch of mathematics that studies sets, which are collections of objects, and forms a foundation for much of mathematics. This guide explains it.
by Skillo StaffGraph theory is the study of graphs, which are structures of points connected by links, used to model relationships and networks. This guide explains graph theory.
by Skillo StaffA finite-state machine is a model of computation that can be in one of a finite number of states and moves between them based on inputs. This guide explains it.
by Skillo StaffA Turing machine is a simple abstract model of computation that helps define what it means for something to be computable. This guide explains the Turing machine.