<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>State Machines on App Coding</title>
    <link>https://appcoding.com/tags/state-machines/</link>
    <description>Recent content in State Machines on App Coding</description>
    <generator>Hugo</generator>
    <language>en-us</language>
    <lastBuildDate>Fri, 09 Oct 2026 00:00:00 +0000</lastBuildDate>
    <atom:link href="https://appcoding.com/tags/state-machines/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Counterfactual Store vs. Markov Chains: From Branching State to Reach, an Engine for Possible Futures</title>
      <link>https://appcoding.com/counterfactual-store-vs.-markov-chains-from-branching-state-to-reach-an-engine-for-possible-futures/</link>
      <pubDate>Fri, 09 Oct 2026 00:00:00 +0000</pubDate>
      <guid>https://appcoding.com/counterfactual-store-vs.-markov-chains-from-branching-state-to-reach-an-engine-for-possible-futures/</guid>
      <description>&lt;p&gt;The &lt;a href=&#34;https://appcoding.com/counterfactual-store-a-database-that-stores-alternatives-not-just-facts/&#34;&gt;Counterfactual Store&lt;/a&gt; does resemble a Markov chain at the conceptual level. Both deal with states and the possible transitions between them. But a Markov chain is mainly a mathematical model for probabilistic transitions: given that I&amp;rsquo;m in state A, what&amp;rsquo;s the probability the next state is B, C or D? And the classic Markov property says the next-state probability depends on the current state, not the full history.&lt;/p&gt;&#xA;&lt;p&gt;The Counterfactual Store is deterministic branching, not probabilistic transition. If the current application state is A, you create a hypothetical A′, change something, propagate the consequences, inspect the result and throw it away without touching A. No probability needs to be involved anywhere.&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
