Definition
In computer science and computer programming, a nondeterministic algorithm is an algorithm that, even for the same input, can exhibit different behaviors on different runs, as opposed to a deterministic algorithm.
Related concepts
AlgorithmBacktracking searchComplexity classComputational complexity theoryComputer programmingComputer scienceConcurrent algorithmDana ScottDeterminismDeterministic algorithmDeterministic finite automatonEnrico FermiEquation of State Calculations by Fast Computing MachinesExpected timeFlow chartFree willHenry Cabourn PocklingtonHugh C. WilliamsJeffrey ShallitJournal of the ACMLas Vegas algorithmMichael O. RabinModel of computationMonte Carlo algorithmMonte Carlo methodNicholas MetropolisNondeterministic Turing machineNondeterministic finite automatonNondeterministic programmingNondeterministic spaceNondeterministic timeP versus NP problemPhilosophyPocklington's algorithmProbabilistic algorithmRace conditionRandom number generatorRandomized algorithmRegular languageRobert W. FloydSquare rootStanislaw UlamStephen C. KleeneTuring machine
8 concepts already in your glossary