← All parts of this equation

Equation 9 · Part 1 · The Hardest Unsolved Problems in AI Agent Architecture

Symbol b

b′(s′)=η O(o∣s′,a)∑sT(s′∣s,a) b(s),b'(s') = \eta \, O(o \mid s', a) \sum_{s} T(s' \mid s, a)\, b(s),
bb

What this part means

the agent’s probability distribution over possible states before an observation.

Its job in the formula

b is part of the quantity the equation computes from the expression on the right.

Where the article explains it

In the classical formalism, if b(s) is the agent’s probability distribution over possible states before an observation, a is the action just taken, o is the observation that followed, T is the environment’s transition model and O its observation model, the updated belief is b′(s′)=η O(o∣s′,a)∑sT(s′∣s,a) b(s)b'(s') = \eta \, O(o \mid s', a) \sum_{s} T(s' \mid s, a)\, b(s).

The passage around this formula

A useful decomposition for what an agent needs to track is the belief it holds over the true state of its task, updated as new observations arrive. In the classical formalism, if b(s) is the agent’s probability distribution over possible states before an observation, a is the action just taken, o is the observation that followed, T is the environment’s transition model and O its observation model, the updated belief is b′(s′)=η O(o∣s′,a)∑sT(s′∣s,a) b(s)b'(s') = \eta \, O(o \mid s', a) \sum_{s} T(s' \mid s, a)\, b(s). with η\eta a normalizing constant.…

Read this part in the article →

Learn the underlying idea

A function assigns an output to each allowed input. The expression f(x) means “apply f to x”.

Open the illustrated functions: inputs become outputs guide →

See this notation across published equations →

Sources cited in the surrounding passage

These citations provide research context; check each source for the exact claim it supports.