Jump to content

Matrix mortality problem

Edit links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Jean Abou Samra (talk | contribs) at 09:38, 24 April 2024 (Create). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

In computer science, the matrix mortality problem is a decision problem that asks, given a finite set of n×n matrices with integer coefficients, whether the zero matrix can be expressed as a finite product of matrices from this set.

The matrix mortality problem is known to be undecidable for n ≥ 3[1].

Notes

  1. ^ Paterson, Mike (1970). "Unsolvability in 3×3 matrices". Studies in Applied Mathematics. 49: 105–107.
Stub icon

This computer science article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Matrix_mortality_problem&oldid=1220525266"