[racket] Checking infinite loops

From: Jens Axel Søgaard (jensaxel at soegaard.net)
Date: Mon Oct 4 16:27:51 EDT 2010

2010/10/4 Marco Morazan <morazanm at gmail.com>:
> What year of study are you in?
> I will assume you are a beginner. It can't be done in Racket or any
> other programming language. Most Automata Theory books have a proof of
> that The Halting Problem is unsolvable.

Which by the way explains why companies like B&O (Bang and Olufsen)
use non-Turing Complete languages in their remote controls.
This allows them to run automated checkers to prove their remotes
never lock up.

Jens Axel Søgaard

Posted on the users mailing list.