Glossary of module theory: Difference between revisions
Jump to navigation
Jump to search
en>Rgdboer |
en>Escspeed m Changed "Drinfel'd" to "Drinfeld" |
||
| Line 1: | Line 1: | ||
[[File:Turing machine 2b.svg|right|200px]] | |||
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]] | |||
Revision as of 21:35, 16 January 2013
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 or sometimes .
Study of crossing sequences is carried out, e.g., in computational complexity theory.
References
43 year old Petroleum Engineer Harry from Deep River, usually spends time with hobbies and interests like renting movies, property developers in singapore new condominium and vehicle racing. Constantly enjoys going to destinations like Camino Real de Tierra Adentro.