Gabriel Istrate
gistrate.bsky.social
Gabriel Istrate
@gistrate.bsky.social
Computer Scientist, University of Bucharest. Theoretical Computer Science, Multiagent Systems, Complex Systems (and MUCH MORE)
Wow, why did I never think of that 😀
August 17, 2025 at 2:28 PM
On the other hand, many aspects of symbolic dynamics are undecidable:

shorturl.at/5H3DM

(see e.g. Remark 7.24). My impression is that Computational Complexity is somewhat orthogonal to chaos, with connections possible only for special classes of dynamical systems.
The Nature of Computation
Amazon.com: The Nature of Computation: 9780199233212: Moore, Cristopher, Mertens, Stephan: Books
shorturl.at
May 13, 2025 at 12:29 PM
Certainly don't know about pseudorandomness, not even computational complexity, but if you want a book (!) on formal language theory applied to symbolic dynamics please see

shorturl.at/emp1a
GRAMMATICAL COMPLEXITY AND ONE-DIMENSIONAL DYNAMICAL SYSTEMS (Directions in Chaos, 6)
Buy GRAMMATICAL COMPLEXITY AND ONE-DIMENSIONAL DYNAMICAL SYSTEMS (Directions in Chaos, 6) on Amazon.com ✓ FREE SHIPPING on qualified orders
shorturl.at
May 13, 2025 at 12:22 PM
Reposted by Gabriel Istrate
As SFI President David Krakauer puts it, “The Santa Fe Institute is metaphorically a Monastery in the Mountains — living at the edge of wilderness and society.”
December 19, 2024 at 8:10 PM
Reposted by Gabriel Istrate
I wanted my Algorithms students to program NP hardness reductions so we developed Karp. A domain specific language for writing Karp reductions. Our students are quite good with a debugger, so reducing learning Theory to debugging seemed like a win. docs.racket-lang.org/karp/index.h...
Karp: A Language for NP Reductions
docs.racket-lang.org
November 27, 2024 at 4:48 AM