Transcript - Revision history

Polygon: Used Template:Stub

2025-08-10T22:40:58Z

Used Template:Stub

← Older revision		Revision as of 22:40, 10 August 2025
Line 1:		Line 1:
			{{Stub}}
	A [[Turing machine]] '''transcript''' or '''transition history''' is the sequence of transitions that the TM executes when started on a blank tape. Halting TMs have finite transcripts, infinite TMs have infinite transcripts. A finite description of an infinite TM transcript is one way to specify the forward behavior of that TM precisely.		A [[Turing machine]] '''transcript''' or '''transition history''' is the sequence of transitions that the TM executes when started on a blank tape. Halting TMs have finite transcripts, infinite TMs have infinite transcripts. A finite description of an infinite TM transcript is one way to specify the forward behavior of that TM precisely.

Line 5:		Line 6:
	== References ==		== References ==
	<references />		<references />

	~~[[Category:Stub]]~~

Sligocki: Capitalization

2024-11-13T17:32:50Z

Capitalization

← Older revision		Revision as of 17:32, 13 November 2024
Line 1:		Line 1:
	A [[Turing machine]] '''transcript''' or '''transition history''' is the sequence of transitions that the TM executes when started on a blank tape. Halting TMs have finite transcripts, infinite TMs have infinite transcripts. A finite description of an infinite TM transcript is one way to specify the forward behavior of that TM precisely.		A [[Turing machine]] '''transcript''' or '''transition history''' is the sequence of transitions that the TM executes when started on a blank tape. Halting TMs have finite transcripts, infinite TMs have infinite transcripts. A finite description of an infinite TM transcript is one way to specify the forward behavior of that TM precisely.

	[[Shift rule]]s lead to repeated segments of a TM transcript and vice-versa every repeated segment in a transcript corresponds to a shift rule. If we augment TM transcripts to detect the difference between initial and written blank symbols, then all [[~~Translated Cycler~~]]s can be detected by noticing a repeat in the transcript that contains at least one initial blank.<ref>Shawn Ligocki. 2024. "TM Transcripts". https://www.sligocki.com/2024/06/12/tm-transcripts.html</ref>		[[Shift rule]]s lead to repeated segments of a TM transcript and vice-versa every repeated segment in a transcript corresponds to a shift rule. If we augment TM transcripts to detect the difference between initial and written blank symbols, then all [[translated cycler]]s can be detected by noticing a repeat in the transcript that contains at least one initial blank.<ref>Shawn Ligocki. 2024. "TM Transcripts". https://www.sligocki.com/2024/06/12/tm-transcripts.html</ref>

	== References ==		== References ==

Sligocki: ref section

2024-11-13T17:31:49Z

ref section

← Older revision		Revision as of 17:31, 13 November 2024
Line 2:		Line 2:

	[[Shift rule]]s lead to repeated segments of a TM transcript and vice-versa every repeated segment in a transcript corresponds to a shift rule. If we augment TM transcripts to detect the difference between initial and written blank symbols, then all [[Translated Cycler]]s can be detected by noticing a repeat in the transcript that contains at least one initial blank.<ref>Shawn Ligocki. 2024. "TM Transcripts". https://www.sligocki.com/2024/06/12/tm-transcripts.html</ref>		[[Shift rule]]s lead to repeated segments of a TM transcript and vice-versa every repeated segment in a transcript corresponds to a shift rule. If we augment TM transcripts to detect the difference between initial and written blank symbols, then all [[Translated Cycler]]s can be detected by noticing a repeat in the transcript that contains at least one initial blank.<ref>Shawn Ligocki. 2024. "TM Transcripts". https://www.sligocki.com/2024/06/12/tm-transcripts.html</ref>

			== References ==
			<references />

	[[Category:Stub]]		[[Category:Stub]]

Sligocki: Created page with "A Turing machine '''transcript''' or '''transition history''' is the sequence of transitions that the TM executes when started on a blank tape. Halting TMs have finite transcripts, infinite TMs have infinite transcripts. A finite description of an infinite TM transcript is one way to specify the forward behavior of that TM precisely. Shift rules lead to repeated segments of a TM transcript and vice-versa every repeated segment in a transcript corresponds to a sh..."

2024-11-13T17:31:07Z

Created page with "A Turing machine '''transcript''' or '''transition history''' is the sequence of transitions that the TM executes when started on a blank tape. Halting TMs have finite transcripts, infinite TMs have infinite transcripts. A finite description of an infinite TM transcript is one way to specify the forward behavior of that TM precisely. Shift rules lead to repeated segments of a TM transcript and vice-versa every repeated segment in a transcript corresponds to a sh..."

New page

A [[Turing machine]] '''transcript''' or '''transition history''' is the sequence of transitions that the TM executes when started on a blank tape. Halting TMs have finite transcripts, infinite TMs have infinite transcripts. A finite description of an infinite TM transcript is one way to specify the forward behavior of that TM precisely.

[[Shift rule]]s lead to repeated segments of a TM transcript and vice-versa every repeated segment in a transcript corresponds to a shift rule. If we augment TM transcripts to detect the difference between initial and written blank symbols, then all [[Translated Cycler]]s can be detected by noticing a repeat in the transcript that contains at least one initial blank.<ref>Shawn Ligocki. 2024. "TM Transcripts". https://www.sligocki.com/2024/06/12/tm-transcripts.html</ref>

[[Category:Stub]]