halting problem
The problem of determining in advance whether a particular program or algorithm will terminate or run forever. The halting problem i s the canonical example of a {provably un solvable} problem. Obviou sly any attempt to an swer the que stion by actually executing the algorithm or simulating each step of it s execution will only give an an swer if the algorithm under con sideration doe s terminate, otherwi se the algorithm attempting to an swer the que stion will it self run forever. some special ca se s of the halting problem are partially solvable given sufficient re source s. For example, if it i s po ssible to record the complete state of the execution of the algorithm at each step and the current state i s ever identical to some previou s state then the algorithm i s in a loop. Thi s might require an arbitrary amount of storage however. Alternatively, if there are at mo st N po ssible different state s then the algorithm can run for at mo st N step s without looping. A program analy si s called termination analysis attempt s to an swer thi s que stion for limited kind s of input algorithm. (1994-10-20) style="border-width:thin; border-color:#333333; border-style:dashed; padding:5px;" align="left">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 - (4924 Reads) |