[ot] [wrong] DistractionBot Goes To Work

[Karl]

S_n and a 1 minute delay.

St(n): time person n arrives.
Sts(n): time person n begins being served
Stf(n): time person n is done being served and leaves

Stf(n) = Sts(n) + 1
Sts(n) = max(St(n), Stf(n -1))

Recursively defined.  Can we reorient the process of recursion to define it
as a sum with conditions?  Probably somehow?

>
-------------- next part --------------
A non-text attachment was scrubbed...
Name: not available
Type: text/html
Size: 912 bytes
Desc: not available
URL: <https://lists.cpunks.org/pipermail/cypherpunks/attachments/20210605/54affcfe/attachment.txt>