= Transcomputational problem
{wiki=Transcomputational_problem}
A transcomputational problem refers to a type of computational problem that exceeds the capabilities of any Turing machine or, more broadly, exceeds the limits of computability as defined by the Church-Turing thesis. This means that such problems cannot be solved by any algorithm or computational process that can be performed by a Turing machine, which serves as a fundamental model of computation in computer science.
Back to article page