OurBigBook
About
$
Donate
Sign in
Sign up
by
Ciro Santilli
(@cirosantilli,
32
)
Computable function
Table of contents
Uncomputable function
Uncomputable function
Computable function
The prototypical example is the
Busy beaver function
, which is the easiest example to reach from the
halting problem
.
Ancestors
Undecidable problem
Recursive language
Formal language theory
Computer science
Computer
Information technology
Area of technology
Technology
Index
Discussion (0)
Subscribe (1)
Sign up
or
sign in
create discussions.
There are no discussions about this article yet.
View article source