๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Undecidable problems of elementary number theory

โœ Scribed by John G. Kemeny

Publisher
Springer
Year
1958
Tongue
English
Weight
786 KB
Volume
135
Category
Article
ISSN
0025-5831

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

What makes some language theory problems
What makes some language theory problems undecidable
โœ J. Hartmanis; J.E. Hopcroft ๐Ÿ“‚ Article ๐Ÿ“… 1970 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 487 KB

In the theory of automata and formal languages, the undecidability of various properties has been studied for specific classes of languages. Here we abstract the essence of various proofs of undecidability and find wide classes of properties and general conditions on families of languages such that