OurBigBook About$ Donate
 Sign in+ Sign up
by Ciro Santilli (@cirosantilli, 37)

Mortal matrix problem

 ... Computer science Formal language theory Chomsky hierarchy Recursively enumerable language Recursive language Undecidable problem
 0 By others on same topic  0 Discussions  Updated 2025-05-29  +Created 1970-01-01  See my version
en.wikipedia.org/wiki/Zero_matrix#Occurrences
One of the most simple to state undecidable problems.
The reason that it is undecidable is that you can repeat each matrix any number of times, so there isn't a finite number of possibilities to check.

 Ancestors (11)

  1. Undecidable problem
  2. Recursive language
  3. Recursively enumerable language
  4. Chomsky hierarchy
  5. Formal language theory
  6. Computer science
  7. Computer
  8. Information technology
  9. Area of technology
  10. Technology
  11.  Home

 Incoming links (2)

  • The beauty of mathematics
  • Undecidable problem

 View article source

 Discussion (0)

+ New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic + Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook