Transposition of an \(\ell \times \ell\) matrix requires \(\Omega\) (log \(\ell)\) reversals on conservative Turing machines (Q1111379): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Reversal Complexity / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Fast Computer Method for Matrix Transposing / rank | |||
Normal rank | |||
Latest revision as of 09:58, 19 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Transposition of an \(\ell \times \ell\) matrix requires \(\Omega\) (log \(\ell)\) reversals on conservative Turing machines |
scientific article |
Statements
Transposition of an \(\ell \times \ell\) matrix requires \(\Omega\) (log \(\ell)\) reversals on conservative Turing machines (English)
0 references
1988
0 references
We consider matrix transposition on a k-tape Turing machine which treats entries of a matrix as indivisible entities (`pebbles'). We call such a machine a conservative k-tape machine. We show that such a machine requires \(\Omega\) (log \(\ell)\) reversals to transpose an \(\ell \times \ell\) matrix.
0 references
peppling game
0 references
matrix transposition
0 references
Turing machine
0 references
conservative k-tape machine
0 references
