A tag is a keyword or label that categorizes your question with other, similar questions. Using the right tags makes it easier for others to find and answer your question.
Rice's Theorem states that any (non-trivial) property of Turing machines is undecidable.
Questions about methods for estimating the increase in runtime of an algorithm as the input size increases.
Creating samples from a well-specified population using a probabilistic method and/or producing random numbers from a specified distribution.
the problem of determining whether there is a variable assignment that fulfills a given Boolean formula.
Questions regarding solver programs for the boolean satisfiability problem.
Questions about the optimisation problem of ordering a set of tasks so that some objective function (e.g. makespan) is minimised. The set of constraints is crucial; in particular, there is a large bod…
Algorithms for finding an element in some specified data-structure (most commonly, in a tree).
A class of computational problems. Where decision problems call for a yes-or-no answer, search problems are looking for an object satisfying a certain property.
Questions about search trees, a class of data structures used for storing sorted data for efficient access.
Questions about matters of computer, software and communication security, that is how to protect systems against attacks.
Semantics formally describe the meaning of some syntax.
semi-decidable, also known as recognizable or recursively enumerable.
Questions about finite and infinite sets and multisets, related data structures and concepts.
Questions about the algorithmic problems of finding shortest paths between nodes in a graph.
For questions about processing data from sensors (e.g., audio and video data), and *not* handling operating system signals. Note that there is also a dedicated Signal Processing Stack Exchange, which …
Questions about simulating one model in another. This includes simulating reality in any model, or simulating a machine model with Turing machines.
Solver programs for the Satisfiability Modulo Theories (SMT). The SMT problem is a decision problem for logical formulas with combinations of background theories expressed in classical first-order log…