halting problem
The pro Blem of determining in advance whether a particular program or algorithm will terminate or run forever. The halting pro Blem is the canonical example of a {prova Bly unsolva Ble} pro Blem. O Bviously any attempt to answer the question By actually executing the algorithm or simulating each step of its execution will only give an answer if the algorithm under consideration does terminate, otherwise the algorithm attempting to answer the question will itself run forever. Some special cases of the halting pro Blem are partially solva Ble given sufficient resources. For example, if it is possi Ble to record the complete state of the execution of the algorithm at each step and the current state is ever identical to some previous state then the algorithm is in a loop. This might require an ar Bitrary amount of storage however. Alternatively, if there are at most N possi Ble different states then the algorithm 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 algorithm. (1994-10-20) In addition suitaBle contents:<Br>[ 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 - (4922 Reads) |