Jump to content
Main menu
Main menu
move to sidebar
hide
Navigation
Main page
Recent changes
Random page
freem
Search
Search
Appearance
Create account
Log in
Personal tools
Create account
Log in
Pages for logged out editors
learn more
Contributions
Talk
Editing
Openai/693343d7-a38c-8012-a67c-11cbed4c0fd9
(section)
Add languages
Page
Discussion
English
Read
Edit
Edit source
View history
Tools
Tools
move to sidebar
hide
Actions
Read
Edit
Edit source
View history
General
What links here
Related changes
Special pages
Page information
Appearance
move to sidebar
hide
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==== ### ==== * Agt is a (small) V-enriched category: Hom(A,B) β V (captures affinity or more general graded relation). * Observations are modeled by a Grothendieck fibration: ``<code> Ο : Obs β World </code>`` each agent A has perception section P_A : World β Obs with Ο β P_A = Id. ===== - O : Agt β Agt with Ξ· : Id β O, ΞΌ : O O β O. ===== * O supports: - reflect β‘ Ξ· - ΞΌ flattening of nested agency - join_W : O A Γ O A β O A (affinity-parameterized merge) - sim : O A β Traj(A) (natural in A) Monad laws hold for all A: <syntaxhighlight>ΞΌ β O Ξ· = id, ΞΌ β Ξ·_O = id, ΞΌ β O ΞΌ = ΞΌ β ΞΌ_O </syntaxhighlight> ===== - Aff : Agt^op Γ Agt β V (a V-profunctor). ===== * Composition defined by coend: <syntaxhighlight>Aff^{(2)}(A,C) := (Aff β Aff)(A,C) = β«^{BβAgt} Aff(A,B) β Aff(B,C). </syntaxhighlight> * Iteration: <syntaxhighlight>Aff^{(n)}(A,Z) β β«^{B1...B_{n-1}} β_{i=0}^{n-1} Aff(B_i,B_{i+1}) where B_0=A, B_n=Z. </syntaxhighlight> This yields multiplicative / path-based transitive affinity when V is a quantale with β product and coends computed as joins (sup).
Summary:
Please note that all contributions to freem are considered to be released under the Creative Commons Attribution-ShareAlike 4.0 (see
Freem:Copyrights
for details). If you do not want your writing to be edited mercilessly and redistributed at will, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource.
Do not submit copyrighted work without permission!
Cancel
Editing help
(opens in new window)