halting problem
The problem of determining in advance whether a particular program or alGorithm will terminate or run forever. The halting problem is the canonical example of a {provably unsolvable} problem. Obviously any attempt to answer the question by actually executing the al Gorithm or simulating each step of its execution will only give an answer if the al Gorithm under consideration does terminate, otherwise the al Gorithm attempting to answer the question will itself run forever. Some special cases of the halting problem are partially solvable given sufficient resources. For example, if it is possible to record the complete state of the execution of the al Gorithm at each step and the current state is ever identical to some previous state then the al Gorithm is in a loop. This might require an arbitrary amount of storage however. Alternatively, if there are at most N possible different states then the al Gorithm can run for at most N steps without looping. A program analysis called termination analysis attempts to answer this question for limited kinds of input al Gorithm. (1994-10-20) In addition suitable contents: [ 2 ] [ = ] [ ad ] [ ag ] [ al ] [ alGorithm ] [ alt ] [ am ] [ an ] [ ar ] [ arc ] [ as ] [ at ] [ b ] [ bi ] [ bit ] [ bv ] [ by ] [ ca ] [ canonical ] [ case ] [ ch ] [ ci ] [ co ] [ com ] [ complete ] [ con ] [ cons ] [ cu ] [ current ] [ de ] [ diff ] [ do ] [ du ] [ ec ] [ ed ] [ er ] [ era ] [ es ] [ et ] [ exec ] [ execution ] [ fi ] [ file ] [ fo ] [ for ] [ ge ] [ gh ] [ gi ] [ gr ] [ h ] [ hm ] [ hr ] [ ht ] [ id ] [ ie ] [ iff ] [ il ] [ in ] [ input ] [ io ] [ ir ] [ is ] [ it ] [ ki ] [ la ] [ Lex ] [ li ] [ loop ] [ lt ] [ lv ] [ ly ] [ mo ] [ mod ] [ module ] [ mount ] [ mp ] [ mu ] [ N ] [ na ] [ nc ] [ ng ] [ ni ] [ nl ] [ no ] [ np ] [ ns ] [ O ] [ om ] [ op ] [ pa ] [ pe ] [ ph ] [ ping ] [ pl ] [ pr ] [ program ] [ provably unsolvable ] [ pt ] [ query ] [ ques ] [ rc ] [ re ] [ record ] [ ro ] [ ru ] [ run ] [ rw ] [ S ] [ se ] [ si ] [ sl ] [ so ] [ source ] [ spec ] [ st ] [ state ] [ storage ] [ su ] [ T ] [ termination analysis ] [ th ] [ to ] [ tr ] [ tt ] [ ua ] [ us ] [ va ] [ ve ] [ vi ]
[ Go Back ]
Free On-line Dictionary of Computing Copyright © by OnlineWoerterBuecher.de - (5020 Reads) |