Timeline for Decidability of matrix problem in ${\mathbb Z}/p{\mathbb Z}$
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 30, 2017 at 10:42 | vote | accept | Dominic van der Zypen | ||
| Oct 30, 2017 at 10:40 | history | edited | YCor |
edited tags
|
|
| Oct 30, 2017 at 10:27 | answer | added | Fedor Petrov | timeline score: 4 | |
| Oct 30, 2017 at 10:24 | comment | added | js21 | Yes. For all $p,n,m$, consider the algorithm which takes $(A_1,\dots,A_n)$ as an input and returns the answer to your question as an output (there are only finitely many possible inputs!). | |
| Oct 30, 2017 at 10:24 | answer | added | Will Sawin | timeline score: 5 | |
| Oct 30, 2017 at 10:00 | history | asked | Dominic van der Zypen | CC BY-SA 3.0 |