A question about the "Post Correspondence problem"

Правка en3, от MOOONI, 2023-06-09 10:51:59

Hey everyone, hope you're having a great day. Here's a question about the famous post correspondence problem This problem is undecidable according to Wiki Pedia, which means there are no algorithms to solve the problem. but can't we simply try all possible permutations of the dominos? what am I misunderstanding?

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en3 Английский MOOONI 2023-06-09 10:51:59 1 Tiny change: 'he famous ![post corr' -> 'he famous [post corr'
en2 Английский MOOONI 2023-06-09 10:51:09 1 Tiny change: 'ce problem ](https://' -> 'ce problem](https://'
en1 Английский MOOONI 2023-06-09 10:50:20 430 Initial revision (published)