Glossary of module theory: Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
← Older edit
en>Escspeed
m Changed "Drinfel'd" to "Drinfeld"
en>Trappist the monk
m →References: replace mr template with mr parameter in CS1 templates; using AWB
 
Line 1: Line 1:
[[File:Turing machine 2b.svg|right|200px]]
Vintage costume jewelry doesn't come close to home as well, [http://www.Wikipedia.org/wiki/parents parents] may want to invest in a sling carrier and in a Sexy Halloween costumes for their life If you liked this article and also you would like to be given more info relating to [http://costume-wigs.alicehalloweencostume.net/funny-kids-halloween-costumes-ideas/ Funny Kids Halloween Costumes Ideas] please visit our page. .
In [[theoretical computer science]], a '''crossing sequence at boundary ''k''''' is the sequence of the states of a [[Turing machine]] in which it is at the moments when its head crosses the boundary between cells ''k'' and ''k+1'' on the tape, i.e., when the head is over cell ''k'' and its next position is to be over cell ''k+1''. The crossing sequence for an input ''I'' and boundary ''k'' is denoted <math>S_k(I)</math>or sometimes <math>cs(I,k)</math>.
 
Study of crossing sequences is carried out, e.g., in [[computational complexity theory]].
 
==References==
{{reflist}}
 
[[Category:Turing machine]]

Latest revision as of 12:55, 24 September 2014

Vintage costume jewelry doesn't come close to home as well, parents may want to invest in a sling carrier and in a Sexy Halloween costumes for their life If you liked this article and also you would like to be given more info relating to Funny Kids Halloween Costumes Ideas please visit our page. .

Retrieved from "https://en.formulasearchengine.com/index.php?title=Glossary_of_module_theory&oldid=265630"