Skip to search formSkip to main contentSkip to account menu

Computable number

Known as: Non-computable number, Uncomputable number, Uncomputable numbers 
In mathematics, computable numbers are the real numbers that can be computed to within any desired precision by a finite, terminating algorithm. They… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
In the current problem set we are investigating two problems in computational geometry using concepts from our study of the… 
2014
2014
Although the survival literature in entrepreneurship is well developed, results are not clear-cut. Moreover, few studies are… 
2012
2012
In [9], Hochman and Meyerovitch gave a complete characterization of the set of topological entropies of Zd shifts of finite type… 
2011
2011
Einführung Zum Thema Konrad Zuse, Erfinder des Computers ist viel geschrieben worden, insbesondere unter Heranziehung… 
Review
2011
Review
2011
This document provides a computational semantics for three versions of First-Order Logic (FOL): minimal, intuitionistic, and… 
1999
1999
PreTEX is a preprocessor for TEX that supplies an author with many tools to simplify the writing and management of larger (book… 
1991
1991
L. Kirby and J. Paris introduced the Hercules and Hydra game on rooted trees as a natural example of an undecidable statement in… 
1983