✦ LIBER ✦

Algorithmical Unsolvability of the Ergodicity Problem for Locally Interacting Processes with Continuous Time

✍ Scribed by André Toom

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Sufficient conditions for convergence of

✍ O. Yu. Kul'chitskii 📂 Article 📅 1979 🏛 Springer US 🌐 English ⚖ 996 KB

Jump statistics, sojourn times, fluctuat

✍ Marcel Ovidiu Vlad; John Ross; Michael C. Mackey 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 873 KB

A computationally efficient numerical al

✍ Tae-Sang Chung; Chia-Ju Wu 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 656 KB

An approximation algorithm for the m-mac

✍ Eugeniusz Nowicki 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 423 KB

An efficient hybrid algorithm for the op

✍ P. Alotto; M. A. Nervi 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 372 KB 👁 2 views

A dynamic programming algorithm for the

✍ Alberto Bosio; Giovanni Righini 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 461 KB