Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!dali.cs.montana.edu!uakari.primate.wisc.edu!sdd.hp.com!spool.mu.edu!uwm.edu!csd4.csd.uwm.edu!man7421
From: man7421@csd4.csd.uwm.edu (Francis Man)
Newsgroups: comp.theory
Subject: Re: Question on halting problem
Message-ID: <11713@uwm.edu>
Date: 3 May 91 06:13:37 GMT
References: <Apr.25.08.44.05.1991.23782@athos.rutgers.edu> <ROCKWELL.91Apr25200531@socrates.socrates.umd.edu>
Sender: news@uwm.edu
Organization: University of Wisconsin - Milwaukee
Lines: 11


	Get yourself to the library and look for the book

		COMPUTABILITY, COMPLEXITY, AND LANGUAGES
		FUNDAMENTALS OF THEORETICAL COMPUTER SCIENCE

		BY MARTIN D. DAVIS AND ELAINE J. WEYUKER
			QA 267.D38 1983
			ISBN 0-12-206380-5
	
	You will find the algorithm of the program for your homework!!!