Emergent algebras as combinatory logic (part IV)

In this post, following “Emergent algebras and combinatory logic (part III)“, I define the class of “computable” graphs in GRAPH and then I show you how differentiability (a generalization of Pansu notion of differentiability on Carnot groups) can be seen as related to this “computability”.

I am using the notations from the last post. See also the post Combinators and zippers for the other notions which I shall use here. The tutorial on graphic lambda calculus may be consulted, if necessary.

_____________________

1. The combinatory logic sector. This is the collection of graphs in GRAPH  denoted by COMBINL which is generated by:

  • untyped lambda calculus zippers,
  • arrows and loops,
  • the S diamond,

s_gate_1

  • the termination gate,

with the operation of linking outputs to inputs,under the constraint that we get graphs with a single output, which has to be either:

  • the upper side output of the S diamond,
  • or the upper side output of a zipper

and with  the moves:

 Remarks:

  1. this sector contains the untyped lambda calculus sector,
  2. conjecture: any graph is COMBINL can be transformed into a finite collection of graphs in the untyped lambda calculus sector.

_____________________

2. Emergent computable graphs.   I define the sector of EMERCOMPUT(A) as the collection of graphs in GRAPH which are generated by the reunion of EMER(A) and COMBINL, with the collection of moves which belong to one of the sectors, that is all moves excepting the dual of the graphic beta move and the ext1 move.

This sector can be described as the collection of graphs in GRAPH generated by:

  • graphs in COMBINL,
  • \Upsilon gate and the gates \bar{\varepsilon} for any \varepsilon \in \Gamma,
  • the approximate sum gate \Sigma_{a} and the approximate difference gate \Delta_{a}, for any a \in A,

with the operations of linking output to input arrows  and with the following list of moves:

_____________________

3. Computably differentiable graphs. A graph A \in GRAPH which has at least one input and one output is computably differentiable if the following graph is in EMERCOMPUT(A)

comp_differ

I shall explain in a future post the meaning of this definition, after writing a bit about differentiability in emergent algebras and about the Pansu differentiability.

Advertisements

3 thoughts on “Emergent algebras as combinatory logic (part IV)”

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s