Hi Helen, came by to say thank you
for you're wonderful friendship
that was very sweet of you! =)
Please keep in touch k..
Anyway, have a lovely week!
Stay you stay beautiful always!
=BNN=

hi dear, i like you

Halting problem:
In computability theory, the halting problem is a decision problem which can be stated as follows: given a description of a program and a finite input, decide whether the program finishes running or will run forever, given that input.

Alan Turing proved in 1936 that a general algorithm to solve the halting problem for all possible program-input pairs cannot exist. We say that the halting problem is undecidable over Turing machines. Copeland (2004) attributes the actual term halting problem to Martin Davis.

sweet glamour shot!

you are very beautiful