This site is updated infrequently. For up-to-date information, please visit the new OCaml website at ocaml.org.

From a recursive circuit to a functional/recursive OCaml-code...
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
 Date: 2006-02-05 (18:20) From: Oliver Bandel Subject: Re: [Caml-list] From a recursive circuit to a functional/recursive OCaml-code...
```On Sat, Feb 04, 2006 at 10:19:43PM +0100, Oliver Bandel wrote:
>
> Hello,
>

dito ;-)

>
> how to implement a simple non-trivial machine (Heinz von Foerster)
> in a purely functional manner?
>
> With functional/recursive OCaml code?
>
> I had written a mail with attachement (which contains a
> jpeg with the structure of the circuit), but it seems it
> was blocked or filtered away by the OCaml mailinglist software?!
>
> So I try to give it as some formulas:
>
>
> let u = func_B x e
> let e = func_C u
> let y = func_A x
>

I started with the wrong things in mind, sorry!

I have picked the original work (the picture I put on the web
was from somwhere else, not the original) from HvF and found
the following description:

A is an operator/function that works like a trivial machine
B is an operator/function that works like a trivial machine
c is the internal state!

So it should be possible to have only c as a state variable and all
other stuff will be derived from the input x and the internal
state c via the functions/operators A and B.

Sorry for the wrong start, it was too long ago when I looked
into the original work! :(

So, now the direction is different.

But nevertheless thanks for all your efforts on helping with
implementing it in OCaml. :)

Regards,
Oliver

```