Transposition of an \(\ell \times \ell\) matrix requires \(\Omega\) (log \(\ell)\) reversals on conservative Turing machines (Q1111379)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4076615
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Transposition of an \(\ell \times \ell\) matrix requires \(\Omega\) (log \(\ell)\) reversals on conservative Turing machines |
scientific article; zbMATH DE number 4076615 |
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
0.828612208366394
0 references
0.8274049162864685
0 references
0.8129058480262756
0 references
