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.
Questions on Hamiltonian paths, that is, paths that visit each vertex exactly once in a graph.
Applications that allow to create formal proofs. They assist the user by finding partial and checking complete proofs.
For questions about representing numbers in base 2 or performing arithmetic on them.
A computational model composed of a grid of stateful cells and a set of rules describing when to change a cell's state.
Questions about the design and analysis of machine learning algorithms.
Questions asking us to check whether your solution is correct are considered off-topic (per http://meta.cs.stackexchange.com/questions/597/) and should not be posted on this site.
a transformation of information to make it unreadable to outside observers
For questions about the interpretation, extension and validity of the Church-Turing thesis, the hypothesis that states that a function is effectively calculable by a human if and only if the function…
Questions about the fundamental component of an operating system, which manages the allocation of resources to applications.
Questions about different distance metrics on strings.
a class of optimization problems in which one has to pack objects together as densely as possible. One could be for example packing rectangles inside a rectangle.
Machine-checked, machine-generated or machine-verified proofs
Questions about algorithms that receive the input piecewise and have to make decisions, that is produce output, before having seen the whole input.
A fundamental problem in distributed computing and multi-agent systems is to achieve overall system reliability in the presence of a number of faulty processes. use this tag for consensus kind of prob…
a general model of computation that investigates a wide range of (potentially non-deterministic) methods of replacing subterms of syntactic expression, more precisely an element of a…
The edit distance (also: Levenshtein distance) between two strings measures the number of insertions and deletions it takes to convert one string to another.
type systems of programming languages
an interactive theorem prover based on the Calculus of Inductive Constructions.
Questions about the concurrency-control requirement of ensuring that no two processes are simultaneously in a critical section (a period when the process is accessing a shared resource). Failing to a…