OurBigBook
About
$
Donate
Sign in
Sign up
Uncomputable function
Ciro Santilli
(
@cirosantilli,
37
)
...
Formal language theory
Chomsky hierarchy
Recursively enumerable language
Recursive language
Undecidable problem
Computable function
Updated
2025-07-16
0
Like
0 By others
on same topic
0 Discussions
Create my own version
The prototypical example is the
Busy beaver function
, which is the easiest example to reach from the
halting problem
.
Tagged
(1)
Busy beaver function
Ancestors
(12)
Computable function
Undecidable problem
Recursive language
Recursively enumerable language
Chomsky hierarchy
Formal language theory
Computer science
Computer
Information technology
Area of technology
Technology
Home
Incoming links
(1)
Busy beaver
View article source
Discussion
(0)
Subscribe (1)
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