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

Computable function

 ... Computer science Formal language theory Chomsky hierarchy Recursively enumerable language Recursive language Undecidable problem
 1 By others on same topic  0 Discussions  Updated 2025-05-29  +Created 1970-01-01  See my version
  • Table of contents
    • Uncomputable function Computable function

Uncomputable function

 0  0 
Computable function
The prototypical example is the Busy beaver function, which is the easiest example to reach from the halting problem.

 Tagged

  • Busy beaver function

 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
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook