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 algor IThm or simulating each step of ITs execution will only give an answer if the algor IThm under consideration does terminate, otherwise the algor IThm 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 algor IThm at each step and the current state is ever identical to some previous state then the algor IThm is in a loop. This might require an arb ITrary amount of storage however. Alternatively, if there are at most N possible different states then the algor IThm can run for at most N steps w IThout looping. A program analysis called termination analysis attempts to answer this question for lim ITed kinds of input algor IThm. (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 - (4921 Reads) |