RE: [slightly OT]Universal Turing machine in XSLT

Play the video

Subject: RE: [slightly OT]Universal Turing machine in XSLT
From: "Jerry Kimmel" <jkimmel@xxxxxxxxxx>
Date: Fri, 27 Aug 2004 12:56:02 -0400

See this:
A Turing machine has an infinite tape that consists of adjacent cells
(or squares). On each cell is written a symbol. The symbols that are
allowed on the tape are finite in number and include the blank symbol.
Each Turing machine has it's own alphabet (i.e., finite set of symbols),
which determines the symbols that are allowed on the tape.

Current Thread
[slightly OT]Universal Turing machine in XSLT Kenneth Stephen - 27 Aug 2004 16:36:02 -0000 David Carlisle - 27 Aug 2004 16:47:17 -0000 Jerry Kimmel - 27 Aug 2004 16:56:28 -0000 <=

<- Previous	Index	Next ->
Re: [slightly OT]Universal Tu, David Carlisle	Thread	xsl:copy, mode and source cod, Dave Jarvis
Re: [slightly OT]Universal Tu, David Carlisle	Date	xsl:copy, mode and source cod, Dave Jarvis
	Month

PURCHASE STYLUS STUDIO ONLINE TODAY!

Purchasing Stylus Studio from our online shop is Easy, Secure and Value Priced!

Download The World's Best XML IDE!

Accelerate XML development with our award-winning XML IDE - Download a free trial today!

Subscribe in XML format

RSS 2.0
Atom 0.3

XML Editor - Download a 15 Day Free Trial Now >

See What's New in Stylus Studio >

Buy Stylus Studio - XML Editor - Now >