« first day (4280 days earlier)      last day (655 days later) » 

3:36 PM
135
A: What are the most attractive Turing undecidable problems in mathematics?

John StillwellThe mortality problem for $3\times 3$ matrices: given a finite set $F$ of $3\times 3$ integer matrices, decide whether the zero matrix is a product of members of $F$ (with repetitions allowed). This was proved unsolvable by Michael Paterson, Studies in Applied Mathematics 49 (1970), 105--107, d...

1 message moved from Logic
 

« first day (4280 days earlier)      last day (655 days later) »