e/Turing's proof

New Query

Information
has glosseng: Richards paradox In 1905 Jules Richard presented this profound paradox. Alan Turings first proof constructs this paradox with his so-called computing machine and proves that this machine cannot answer a simple question: will this machine be able to determine if any computing machine (including itself) will become trapped in an unproductive "infinite loop" (i.e. it fails to continue its computation of the diagonal number).
lexicalizationeng: Turing's proof
instance of(noun) a formal series of statements showing that if one thing is true something else necessarily follows from it
proof

Query

Word: (case sensitive)
Language: (ISO 639-3 code, e.g. "eng" for English)


Lexvo © 2008-2024 Gerard de Melo.   Contact   Legal Information / Imprint