✦ LIBER ✦

Undecidability, incompleteness and Arnol'd problems

✍ Scribed by Newton C. A. da Costa; Francisco A. Doria

Publisher: Springer Netherlands
Year: 1995
Tongue: English
Weight: 589 KB
Volume: 55
Category: Article
ISSN: 0039-3215
DOI: 10.1007/bf01053030

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Undecidability and intuitionistic incomp

Undecidability and intuitionistic incompleteness

✍ D. C. McCarty 📂 Article 📅 1996 🏛 Springer Netherlands 🌐 English ⚖ 385 KB

Undecidability Of Some Domino Connectabi

Undecidability Of Some Domino Connectability Problems

✍ H.-D. Ebbinghaus 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 186 KB

Watson–Crick D0L systems: generative pow

Watson–Crick D0L systems: generative power and undecidable problems

✍ Petr Sosı&#x0301;k 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 244 KB

The Maslov-Arnol'd index and phase trans

The Maslov-Arnol'd index and phase transitions

✍ Noboyuki Murai; Hitoshi Tsumuraya 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 295 KB

On the undecidability of probabilistic p

On the undecidability of probabilistic planning and related stochastic optimization problems

✍ Omid Madani; Steve Hanks; Anne Condon 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 281 KB

The undecidability of some equivalence p

The undecidability of some equivalence problems concerning ngsm's and finite substitutions

✍ P. Turakainen 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 437 KB

It is shown to be undecidable whether an c-free finite substitution and a two-state simple E-free ngsm are equivalent on {a, b}\*. Consequently, the state-minimization of such ngsm's and the nonterminal-minimization of linear grammars having two nonterminals are undecidable. Applications to some ot