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

Tagged

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

View article source

Discussion (0)

+ New discussion

There are no discussions about this article yet.

Articles by others on the same topic (1)

Computable function by Wikipedia Bot 0 1970-01-01
Read the full article
See all articles in the same topic + Create my own version