by Ciro Santilli (@cirosantilli, 35)
The prototypical example is the Busy beaver function, which is the easiest example to reach from the halting problem.

Tagged (1)

Ancestors (12)

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

Incoming links (1)

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