You're reading the public-facing archive of the Category Theory Zulip server.
To join the server you need an invite. Anybody can get an invite by contacting Matteo Capucci at name dot surname at gmail dot com.
For all things related to this archive refer to the same person.
I'm trying to apply my knowledge of dynamics to understand open Petri networks. If I understand, both the most general dynamical systems and Petri networks with a stochastic element are computationally more powerful than the non-stochastic models.
My question is to verify the enhanced computation from stochastic systems and stochastic Petri networks in particular.
I'm not sure they are "computationally more powerful" - it could be true, but I don't know any results about that, and one has to be careful when comparing deterministic models with stochastic ones.
The main difference I know between stochastic models involving Petri nets and deterministic ones is that the former is good for modeling stochastic processes and the latter is good for modeling desterministic processes! For example in chemistry the behavior of atoms is random and we model it using the "master equation", but when there are lots of atoms this randomness may become insignificant and then we use the "rate equation", which is deterministic and much simpler.
I have a free book about Petri nets, the master equation and the rate equation.
@John Baez thanks for the book, I'm reading it now.
What is a list of different systems and their computational power? I've already ordered them as best as I can based on the generality of their matrix representations. For example in dynamics the matrix could be anything.
I don't know much about "computational power" so I can't create such a list. Furthermore there are lots of ways to use Petri nets to compute - I list a bunch in a chapter near the end of my book - and they have different computational power.
I'm definitely one of the worst people on this forum to ask about "computational power", since I've never seriously studied computational complexity, or stuff like the Chomsky hierarchy.
There are systems that are stochastic in observation (although they might be deterministic in nature). Can ACT be used in such cases?
the question 'can CT be used for X' is always yes and no because it depends on what exactly you want to do with it
there's lots of work in categorical probability, recently people have assembled a list of resources here #theory: probability > best intro in 2022
using the formalism of categorical system theory, you can arrange a double category of deterministic lenses but stochastic charts, and see what you can do with that
I think the answer to "can CT be used for X?" is always "yes, if you're smart enough to figure out how - but don't count on us to help you". :upside_down:
well, i didn't want to be mistaken as rude :laughing: but yes
I admit that reply sounds rude, so I usually avoid saying that to people - but unfortunately it's true: we're just beginning to take full advantage of category theory, so there's not a laid-out list of things it can and cannot do.