Definition
In theoretical computer science, a problem is one that asks for a solution in terms of an algorithm. For example, the problem of factoring"Given a positive integer n, find a nontrivial prime factor of n."
Related concepts
Abstract machineAlan SelmanAlgorithmAnalysis of algorithmsAvi WigdersonBPP (complexity)BQPBinary numberCambridge University PressCombinatorial optimizationComplexity classComputational complexityComputational complexity theoryCounting problem (complexity)Decision problemFactoring problemFunction problemHalting problemHardness of approximationImre LeaderIndependent set (graph theory)Integer factorizationInteractive proof systemLateral computingModel of computationNP-hardNatural numbersOded GoldreichOperations researchOptimization problemP (complexity)Primality testingPromise problemProperty testingRegular expressionRelation (mathematics)Search problemSet (mathematics)Shimon EvenString (computer science)The Princeton Companion to MathematicsTheoretical computer scienceTimothy GowersTotal functionTranscomputational problemTravelling salesman problemUndecidable problem
8 concepts already in your glossary