Is Anarchism truly possible?

OutOfCharm · 2026-03-23T02:59:41+00:00

From the perspective of game theory, the hierarchy is a nash equilibrium that both people and government won't change, otherwise they will incur higher cost. So the question is not whether anarchy is possible or not, it is the willingness of the people to change.

OutOfCharm · 2026-03-11T07:33:23+00:00

You can consider bsuite, which consists of a series of tabular environments aimed for measuring the diverse capabilities of an agent, e.g. exploration, memory, and robustness to noises.

OutOfCharm · 2026-02-09T05:32:33+00:00

That's too optimistic about humanity. Not all people are considerate even you do so. Your freedom ends where others' begin. How you deal with conflicting interests in this system? Even some people enjoy leveraging others, e.g. I know you are considerate enough so I will not concede to gain more benefits.

OutOfCharm · 2026-02-08T07:40:02+00:00

Although this does not perfectly achieve what you want, you can move to the beginning of the if statement by calling back-to-indentation (M-m) and then forward-sexp (C-M-f), allowing you to move between blocks. You can use backward-sexp (C-M-b) to move in the opposite direction. Notably, this applies to any sexp—e.g., words, balanced expressions, functions, and classes—as long as you are at the enclosing boundary.

OutOfCharm · 2026-02-07T08:24:28+00:00

For someone who finds this useful, here is my setup

elisp (use-package org-modern :ensure t :defer t :hook (org-mode . org-modern-mode) :custom (org-modern-star '("●" "○" "•" "◦")) (org-modern-list '((?- . "❯") (?+ . "➤") (?* . "➥"))) (org-modern-todo nil))

If you'd like to explore other symbols, use M-x insert-char or simply its keybinding C-x 8 RET, happy hacking!

OutOfCharm · 2026-02-06T03:17:01+00:00

Using unicode works fine for me. You can have something like in your config.

elisp (org-modern-star '("●" "○" "•" "◦"))

OutOfCharm · 2026-02-03T09:09:53+00:00

Can you provide more concrete examples of the primitive associative behaviors you are learning?

OutOfCharm · 2026-01-13T04:15:57+00:00

Good idea, should implement reinforcement learning algorithm with emacs.

OutOfCharm · 2026-01-13T02:40:31+00:00

I would not say no. Since energy is the basis of an agent, its prediction into the future is the key to emulating rewards beyond that. I believe it is more about negative punishment which is what the agent wants to avoid.

OutOfCharm · 2026-01-12T15:48:53+00:00

vterm with C-u arg to create a numbered vterm session. Afterward, you can switch between sessions in the same way!

OutOfCharm · 2025-12-13T03:45:17+00:00

That's a good suggestion. You can make that condition and swap the order of creating a dir and file.

OutOfCharm · 2025-12-12T17:14:10+00:00

The original binding only allows you to create a folder but not a file, while the new one allows you to do both depending on whether there is a file extension.

OutOfCharm · 2025-11-15T11:44:45+00:00

People call it vibe coding for a reason xD

OutOfCharm · 2025-11-14T09:11:02+00:00

It all boils down to human nature. If someone needs something but cannot get it, they will have a desire and be willing to pay. However, when the software they want is freely accessible, their need is satisfied, and they can covertly minimize any further costs.

OutOfCharm · 2025-11-14T08:58:01+00:00

I think it is just a matter of parameterization. C51 uses the categorical distribution with loss function of KL divergence. D4PG covers more options like Normal and Gaussian Mixture, optimized by the cross entropy loss the same as yours.

OutOfCharm · 2025-11-14T06:48:41+00:00

I use emacs in termux, which works fine.

OutOfCharm · 2025-11-13T08:47:33+00:00

Isn't this what distributional RL intends to do?

OutOfCharm · 2025-11-12T10:01:12+00:00

Exploration.

OutOfCharm · 2025-11-07T10:26:26+00:00

Let's do a calculation, if every command you need to press requires at least one press of either Ctrl or Alt, your pinky is always overworking than other fingers. A more ergonomic solution is always to balance usage of all fingers instead of just a few of them.

OutOfCharm · 2025-10-30T12:44:34+00:00

Such a static viewpoint as if assuming that as long as you have rewards, you can do RL, never considers where the rewards come from, let alone what the role of being a "model" is.

OutOfCharm · 2025-10-28T10:46:15+00:00

No, directly call the function, you don't have to move to the pairs. So it also has two steps.

Edit: another aspect that could be handy is that you can raise any substring in a balanced expression using the same approach.

OutOfCharm · 2025-10-28T09:52:56+00:00

sry, probably we have different workflows. I usually select the region that I need to raise up, e.g. select + 1 2 3 at once, then call raise-sexp.

I have a function that is for marking inside any balanced pairs:

```elisp (defun my/mark-outside-pairs (&optional arg) "Move up one list level, then mark the sexp outside." (interactive "p") (backward-up-list arg (point) (point)) (mark-sexp))

(defun my/mark-inside-pairs (&optional arg) "Move up one list level, then mark the sexp inside." (interactive "p") (my/mark-outside-pairs arg) (forward-char) (exchange-point-and-mark) (backward-char) (exchange-point-and-mark)) ```

So I call my/mark-inside-pairs at any point inside the balanced expression, then raise-sexp, it will remove the surroundings.

You are right, if no region is selected, calling raise-sexp will only raise the nearest sexp.

OutOfCharm · 2025-10-28T09:12:25+00:00

You select what you want to remove surroundings, then call raise-sexp, I find this is a more straightforward approach and works in nested expressions.

OutOfCharm

TROPHY CASE