Sadie
Bluelight Crew
Sticky
Sticky
Delicious
Quim...
Delicious
EntscheidungsproblemQuim...
Entscheidungsproblem
is clearly an infinite loop as there is no way to break out of it. But what if there is a conditional that will never be satisfied in practice?bored kids in Derby on computers being demonstrated in shops said:10 PRINT "FOREST ARE SHIT ";
20 GOTO 10
Now imagine line 65 replaced by something that depends on external input, and you can see there is no way to tell if it will terminate. Analysing a loop to see if it is infinite, is itself potentially infinite: you can only know for sure under very limited circumstances, otherwise you end up stuck in an endless loop with no way to be sure it's really endless until the universe collapses on you.10 FOR N=10 TO 1 STEP -1
20 PRINT N; "GREEN BOTTLES, HANGING ON THE WALL"
30 PRINT N; "GREEN BOTTLES, HANGING ON THE WALL"
40 PRINT "AND IF ONE GREEN BOTTLE SHOULD ACCIDENTALLY FALL"
50 PRINT "THERE'D BE "; N-1 ; "GREEN BOTTLES, HANGING ON THE WALL"
60 PRINT
65 IF N <4 THEN N=4
70 NEXT N
Decision Problem. In computing, the problem of whether a given program will terminate or stick in an infinite loop. See also some famous dude commemorated by a statue on which there's a picture of me sitting. Turing proved that you cannot generally tell, by inspecting the Source Code of a program, whether or not it will terminate.
Sometimes you can; for instance,is clearly an infinite loop as there is no way to break out of it. But what if there is a conditional that will never be satisfied in practice?
Now imagine line 65 replaced by something that depends on external input, and you can see there is no way to tell if it will terminate. Analysing a loop to see if it is infinite, is itself potentially infinite: you can only know for sure under very limited circumstances, otherwise you end up stuck in an endless loop with no way to be sure it's really endless until the universe collapses on you.
Paronomasiac
((s) R Us)
gonna peek through her key hole :D