Home Articles FAQs XREF Games Software Instant Books BBS About FOLDOC RFCs Feedback Sitemap

computability theory

You are here: irt.org | FOLDOC | computability theory

<mathematics> The area of theoretical computer science concerning what problems can be solved by any computer.

A function is computable if an algorithm can be implemented which will give the correct output for any valid input.

Since computer programs are countable but real numbers are not, it follows that there must exist real numbers that cannot be calculated by any program. Unfortunately, by definition, there isn't an easy way of describing any of them!

In fact, there are many tasks (not just calculating real numbers) that computers cannot perform. The most well-known is the halting problem, the busy beaver problem is less famous but just as fascinating.

["Computability", N.J. Cutland. (A well written undergraduate-level introduction to the subject)].

["The Turing Omnibus", A.K. Dewdeney].


Nearby terms: CompuServe Information Service « CompuServe Interactive Services « Compusult Ltd. « computability theory » computable » Computational Adequacy Theorem » computational complexity

FOLDOC, Topics, A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, ?, ALL

©2018 Martin Webb