Timeline for Undecidable problems in finite graphs
Current License: CC BY-SA 4.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 30 at 10:45 | comment | added | Discrete lizard♦ | You could also encode combinatorial finite undecidable problems as finite graphs. (e.g. Post correspondence problem, Wang tiles) But, just like encoding Turing machines, I don't think those would be natural problems on finite graphs. | |
| May 30 at 4:50 | history | answered | Oscar Smith | CC BY-SA 4.0 |