Embed Notice

HTML Code

<blockquote style="position: relative; padding-left: 55px;"><section><a href="https://mk.magicka.org/notes/9nc9k0ddkcj0013r">jaf (jeff@mk.magicka.org)'s status on Sunday, 17-Dec-2023 08:39:09 JST</a><a href="https://mk.magicka.org/@jeff" title="jeff@mk.magicka.org"><img src="https://gnusocial.jp/theme/gnusocialjp/default-avatar-stream.png" width="48" height="48" alt="jaf" style="position: absolute; left: 0; top: 0;">jaf</a><div><a href="https://lab.nyanide.com/objects/d07311a6-4c3f-42b7-908f-4d46d0e96f21" rel="in-reply-to">in reply to</a><ul><li></ul></div></section><article><p><a href="https://lab.nyanide.com/users/kirby">@kirby@lab.nyanide.com</a> that is the definition of not running multiple times <a href="https://en.wikipedia.org/wiki/Idempotence">https://en.wikipedia.org/wiki/Idempotence</a></p></article><footer><a rel="bookmark" href="https://gnusocial.jp/conversation/2462883#notice-4873019">In conversation</a><time datetime="2023-12-17T08:39:09+09:00" title="Sunday, 17-Dec-2023 08:39:09 JST">about a year ago</time> <span>from <span><a href="https://mk.magicka.org/notes/9nc9k0ddkcj0013r" rel="external" title="Sent from mk.magicka.org via ActivityPub">mk.magicka.org</a></span></span><a href="https://mk.magicka.org/notes/9nc9k0ddkcj0013r">permalink</a><h4>Attachments</h4><ol><li><article><header><div>Domain not in remote thumbnail source whitelist: upload.wikimedia.org</div><h5><a href="https://en.wikipedia.org/wiki/Idempotence">Idempotence</a></h5><div></div></header><div>Idempotence (UK: , US: ) is the property of certain operations in mathematics and computer science whereby they can be applied multiple times without changing the result beyond the initial application. The concept of idempotence arises in a number of places in abstract algebra (in particular, in the theory of projectors and closure operators) and functional programming (in which it is connected to the property of referential transparency).
The term was introduced by American mathematician Benjamin Peirce in 1870 in the context of elements of algebras that remain invariant when raised to a positive integer power, and literally means "(the quality of having) the same power", from idem + potence (same + power).Definition
An element         x    {\displaystyle x}
  ...</div><footer></footer></article></li></ol></footer></blockquote>

Corresponding Notice

Embed this notice
jaf (jeff@mk.magicka.org)'s status on Sunday, 17-Dec-2023 08:39:09 JSTjaf
in reply to
- Pleroma-tan
@kirby@lab.nyanide.com that is the definition of not running multiple times https://en.wikipedia.org/wiki/Idempotence
In conversationabout a year ago from mk.magicka.orgpermalink
Attachments
1. Domain not in remote thumbnail source whitelist: upload.wikimedia.org
  Idempotence
  Idempotence (UK: , US: ) is the property of certain operations in mathematics and computer science whereby they can be applied multiple times without changing the result beyond the initial application. The concept of idempotence arises in a number of places in abstract algebra (in particular, in the theory of projectors and closure operators) and functional programming (in which it is connected to the property of referential transparency). The term was introduced by American mathematician Benjamin Peirce in 1870 in the context of elements of algebras that remain invariant when raised to a positive integer power, and literally means "(the quality of having) the same power", from idem + potence (same + power). Definition An element x {\displaystyle x} ...

Public

Embed Notice

HTML Code

Corresponding Notice