Monads are a concept of category theory which can be used to structure functional programs or even define nonstandard interpretations of the λ-calculus. These nonstandard functional languages share many of Lucid’s unusual features, such as the distinction between synchronic and general functions. In fact Lucid is exactly one of these languages, determined by a simple stream monad. We therefore ...

AI systems can create, propagate, support, and automate bias in decision-making processes. To mitigate biased decisions, we both need to understand the origin of define what it means for an algorithm make fair decisions. Most group fairness notions assess a model's equality outcome by computing statistical metrics on outputs. We argue that these output encounter intrinsic obstacles present comp...

In this paper we study the notion of Smarandache semirings and semifields and obtain some interesting results about them. We show that not every semiring is a Smarandache semiring. We similarly prove that not every semifield is a Smarandache semifield. We give several examples to make the concept lucid. Further, we propose an open problem about the existence of Smarandache semiring S of finite ...

Dreaming and psychosis share important features, such as intrinsic sense perceptions independent of external stimulation, and a general lack of criticism that is associated with reduced frontal cerebral activity. Awareness of dreaming while a dream is happening defines lucid dreaming (LD), a state in which the prefrontal cortex is more active than during regular dreaming. For this reason, LD ha...

Abstract A novel trend in the theory of thermodynamic limits for energy convertors and traditional heat & mass exchangers is analysed where certain special controls called the Carnot control variables play a common role. In terms of these controls an expression for the lost work has the same form in irreversible energy convertors and in traditional processes of purely dissipative transport. For...

We show that a very general form of Lucid (and RLucid) tail-recursive function can be transformed into an indexical equivalent. We show also that the standard indexical translations of the wvr and upon functions can be considered to be particular cases of the general situation. We give full proofs of the results, taking advantage of the clean semantics of Lucid.