Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!uwm.edu!uwvax!daffy!khan.cs.wisc.edu!quale
From: quale@khan.cs.wisc.edu (Douglas E. Quale)
Newsgroups: comp.lang.misc
Subject: Re: Halting Problem Solved! Film at 11! (Was Re: definitions)
Message-ID: <1991May5.135342.13792@daffy.cs.wisc.edu>
Date: 5 May 91 13:53:42 GMT
References: <30040@dime.cs.umass.edu> <truesdel.673301155@sun418> <30082@dime.cs.umass.edu>
Sender: news@daffy.cs.wisc.edu (The News)
Organization: University of Wisconsin -- Madison
Lines: 18

In article <30082@dime.cs.umass.edu> yodaiken@chelm.cs.umass.edu (victor yodaiken) writes:
>
>Real computers correspond to finite state machines not turing machines,
>thus the halting problem is trivially (in theory of course, not in
>practice) solvable for real computers. If you provide a formal 

and later

>turing machines. This does not mean that there is no algorithm for
>solving the halting problem for all interesting cases. Turing's

Naturally ``interesting'' is a subjective term, but I find the busy beaver
problem interesting, and it's unsolvable.

I should also point out that real computers are *not* finite state machines.

-- Doug Quale
quale@khan.cs.wisc.edu