🚀 go-pugleaf

> Programming a Turing machine is easy....  

But where do you find a Turing machine?  Be the first one on your disk 
block to be running NanoC, the amazing Turing-machine emulator language.  
Its completely written in C and portable to any UNIX box!  

But thats not all.  If you order now, you get tested NanoC software, 
such as this program which converts not just one "a", not just 
two a's, or even ten a's, but ANY string of a's to a string of b's!

	{
	   while [a] {!b; +1;} 
	   halt;
	}

And no more messy state-transition tables - NanoC is a STRUCTURED Turing 
machine language!  While-do, do-while, if-else, and the incredible HALT 
statement.  Mr. Theory says "it's as computationally powerful as FORTRAN!"
Your family will spend many fun-filled hours writing binary additions, 
unary multiplies, and Ada compilers in NanoC.

Order now by ...

[Seriously, NanoC really exists and is free for the asking.  It even 
 has a man page.  I wrote the interpreter on a lark last summer.
 Example programs include a binary adder, counter, and hailstone-number
 (3n+1 problem) checker.]

Arch D. Robison
University of Illinois at Urbana-Champaign
	
CSNET: robison@UIUC.CSNET
UUCP: {ihnp4,pur-ee,convex}!uiucdcs!robison
ARPA: robison@A.CS.UIUC.EDU (robison@UIUC.ARPA)