Turing machine: Revision history

14 December 2024

• curprev 22:0022:00, 14 December 2024‎ Atravers talk contribs‎ 379 bytes −24,472‎ Previous content moved to "Descriptions of Turing machines inspired by combinatory logic" Tag: Replaced

16 July 2012

• curprev 05:3205:32, 16 July 2012‎ Scry talk contribs‎ m 24,851 bytes −2‎ →‎Syntax

6 February 2007

• curprev 18:3318:33, 6 February 2007‎ BrettGiles talk contribs‎ 24,853 bytes +34‎ Add foundations infobox

26 October 2006

• curprev 17:0617:06, 26 October 2006‎ BrettGiles talk contribs‎ m 24,819 bytes −28‎ →‎Search: Reduce the colour purple

17 August 2006

• curprev 16:1316:13, 17 August 2006‎ EndreyMark talk contribs‎ m 24,847 bytes +4‎ →‎Search: State name misspelled
• curprev 16:0816:08, 17 August 2006‎ EndreyMark talk contribs‎ 24,843 bytes +2,872‎ →‎Search: : Modularizing Monk's ``left seek 0'': let us not exlude the starting from the process of search
• curprev 14:4014:40, 17 August 2006‎ EndreyMark talk contribs‎ m 21,971 bytes +1‎ Dummy edit: ``blank'' versus ``Letter *''
• curprev 14:3814:38, 17 August 2006‎ EndreyMark talk contribs‎ m 21,970 bytes 0‎ blank vs Letter 1 instead of 0 vs 1 or blank vs letter 1
• curprev 14:0814:08, 17 August 2006‎ EndreyMark talk contribs‎ 21,970 bytes +4,693‎ →‎Examples: for Turing machine descriptions (``program source code samples''): →‎Simple moves: and →‎Simple rewritings: , see Monk T_right, T_left, T_0, T_1

5 June 2006

• curprev 13:3113:31, 5 June 2006‎ EndreyMark talk contribs‎ m 17,277 bytes −27‎ Initiating a Circular programming page

30 May 2006

• curprev 02:0102:01, 30 May 2006‎ EndreyMark talk contribs‎ m 17,304 bytes +17‎ In →‎Tagging structure: section: format the word CPS as a link to the Continuation page

23 May 2006

• curprev 14:1514:15, 23 May 2006‎ EndreyMark talk contribs‎ 17,287 bytes +468‎ Links to American Mathematical Society pages, see →‎Links: and also →‎Implementations
• curprev 12:2112:21, 23 May 2006‎ EndreyMark talk contribs‎ 16,819 bytes +825‎ Writing an →‎Introduction: section. Splitting off a section →‎Links: . Others: the previous change (Maybe2 expalnation) took part in section →‎A construct called Maybe2
• curprev 11:5011:50, 23 May 2006‎ EndreyMark talk contribs‎ 15,994 bytes +458‎ Programming guidelines#Types recommends avoiding Maybe2 x y construct, suggests Maybe (x, y) instead. Turing definition language uses Maybe2, so I explain my motivations to do so.

17 May 2006

• curprev 10:1010:10, 17 May 2006‎ EndreyMark talk contribs‎ 15,536 bytes +707‎ Expressing syntax highlighting information in pure black&white ASCII text: capitalization rules. See →‎Example: and →‎Arity (represented with font)
• curprev 00:2500:25, 17 May 2006‎ EndreyMark talk contribs‎ m 14,829 bytes +77‎ Finer distinction between: (1) Maybe(Just,Maybe)-inspired special state and symbol (2) Maybe2(Just2,Nothing2)-inspired halting solution. See →‎Arity (represented with font)
• curprev 00:0200:02, 17 May 2006‎ EndreyMark talk contribs‎ m 14,752 bytes +1‎ Human spell-check after ispell: ``chasing'' --> ``choosing''

16 May 2006

• curprev 23:5623:56, 16 May 2006‎ EndreyMark talk contribs‎ m 14,751 bytes −1,621‎ Spell check with ispell + some typos in Haskell examples
• curprev 23:3723:37, 16 May 2006‎ EndreyMark talk contribs‎ 16,372 bytes +58‎ In →‎Language: , a trick with type synonyms and Maybe is accompanied with a better naming convention. Refining accordingly section →‎Discernable non-emptyness: special state, special symbol
• curprev 23:2123:21, 16 May 2006‎ EndreyMark talk contribs‎ 16,314 bytes +1,447‎ In →‎Example: extending syntax highlighting: arity (of commands and state/symbol/action constructors) is represented by font type. →‎Arity (represented with font)

1 May 2006

• curprev 12:1812:18, 1 May 2006‎ EndreyMark talk contribs‎ 14,867 bytes +392‎ Citing original source of the idea of →‎Tagging structure: and its relatedness to Haskell and functional programming
• curprev 11:5611:56, 1 May 2006‎ EndreyMark talk contribs‎ 14,475 bytes +1,099‎ Explaning the motivation, why a →‎Tagging structure: has been incorporated in the Turing machine definition language
• curprev 01:0301:03, 1 May 2006‎ EndreyMark talk contribs‎ 13,376 bytes +111‎ Giving Wikipedia links explaining what a tally (or unary) notation is
• curprev 00:4600:46, 1 May 2006‎ EndreyMark talk contribs‎ 13,265 bytes +2,657‎ →‎Algebraic background of syntax highlighting: writing on the tagging structure of the keywords of Turung machine definition languge -- this classfication rules the highlighting princples

30 April 2006

• curprev 19:0319:03, 30 April 2006‎ EndreyMark talk contribs‎ m 10,608 bytes +66‎ Moving directions are also special symbols, so they get syntax highlighting (brown), too in the Turing machine defintion language →‎Verbose syntax
• curprev 18:5018:50, 30 April 2006‎ EndreyMark talk contribs‎ m 10,542 bytes +6‎ Better grammatic structure for expressing what is regarded fixed when talking on the limitedness of thehead
• curprev 18:4118:41, 30 April 2006‎ EndreyMark talk contribs‎ 10,536 bytes +337‎ Using term ,,Turing machine definition language'' for what we generally mean when talking on the language of Turing simulator softwares
• curprev 18:2218:22, 30 April 2006‎ EndreyMark talk contribs‎ m 10,199 bytes +96‎ Using the experimented syntax highlight also in inline text, not only in code blocks: see →‎Discernable non-emptyness: special state, special symbol
• curprev 18:1618:16, 30 April 2006‎ EndreyMark talk contribs‎ m 10,103 bytes +2‎ Representing the stress in a sentence by typesetting the stressed word with italics
• curprev 18:0518:05, 30 April 2006‎ EndreyMark talk contribs‎ 10,101 bytes +48‎ Syntax highlight: 0-ary keywords (the special action, state, letter) are typeset boldface in Turing machine description language, →‎Verbose syntax
• curprev 17:5317:53, 30 April 2006‎ EndreyMark talk contribs‎ 10,053 bytes +806‎ Re-coloring: states are green and actions are red, these complementary colors yield a nice view
• curprev 17:2017:20, 30 April 2006‎ EndreyMark talk contribs‎ m 9,247 bytes +174‎ Re-coloring syntax highlight for →‎Verbose syntax: of Turing machine description language
• curprev 16:3716:37, 30 April 2006‎ EndreyMark talk contribs‎ 9,073 bytes +1,388‎ Syntax highlight for the →‎Verbose syntax: of a Turing machine description language
• curprev 14:3914:39, 30 April 2006‎ EndreyMark talk contribs‎ m 7,685 bytes −1‎ typographic convention
• curprev 14:3714:37, 30 April 2006‎ EndreyMark talk contribs‎ 7,686 bytes +954‎ More details on different →‎Variants: of the conceptual framework of Turing machines: moving conventions -- tape or head moves, idle moves

23 April 2006

• curprev 03:0503:05, 23 April 2006‎ EndreyMark talk contribs‎ 6,732 bytes +700‎ More precise description of the requirement →‎Discernable non-emptyness: special state, special symbol
• curprev 02:2902:29, 23 April 2006‎ EndreyMark talk contribs‎ 6,032 bytes +1,697‎ Adding new section: →‎Variants: of defining the concept of Turing machine

22 April 2006

• curprev 23:0023:00, 22 April 2006‎ EndreyMark talk contribs‎ m 4,335 bytes +29‎ typos, and Prolog terminology mistake correction
• curprev 22:1522:15, 22 April 2006‎ EndreyMark talk contribs‎ 4,306 bytes +4,306‎ Plans for designing a programming language, which allows us to experiment with the main concepts of Turing machines. Syntax by examples, and some thoughts on the Haskell implementation