OurBigBook
.com (beta)
About
$ Donate
Sign in
Sign up
by
Ciro Santilli
(@cirosantilli,
32
)
Uncomputable 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
Computable function
Undecidable problem
Recursive language
Formal language theory
Computer science
Computer
Information technology
Area of technology
Technology
Index
Incoming links
Busy beaver
Discussion (0)
Subscribe (1)
Sign up
or
sign in
create discussions.
There are no discussions about this article yet.
View article source