niplav @niplav@schelling.pt

Let f be a function that takes as input an inconsistent preference i and produces a set C of consistent preferences. Let S be the set of subgraphs of i for which it holds that for every s∈S: s is an acyclic subgraph, s is a subgraph of i, and s is maximal in i for those properties.

S shall contain all s that fulfill the above conditions.

Let PCS be the property that for every s∈S, s is a subgraph of at least one c∈C (every consistent subpreference appears at least once in a consistent version)

@rrogers Sorry, we just can't live without your banger posts

@zodmagus Also *definitely* never visit sci-sub.se or libgen.rs

Please

@rrogers *adds a name to the list of people to be cloned a million times*

@Cedar Looks fine & juicy to me 👀

Pearl is of course the GOAT, but the book doesn't look like the thing I'm looking for (not quite practical enough)

I kind of want to learn Bayesian Statistics real bad

But like the practical kind you can actually use to calculate likelihood ratios of experiments

Any reccs for textbooks? Ideally with code[1] *and* exercises

[1]: Best of Julia, 2nd best if Python, I don't wanna learn R :-/

Queering Hume's Guillotine: Ontological Crises, von Neumann-Morgenstern-inconsistent Preferences and Two Impossibility Theorems

Functional Decision Theory has a WP page

@doubtshrine@stoat.zone 👍

@rime @empathy2000
Compromise: tipping maximalism[1]

[1]: https://twitter.com/PrinceVogel/status/1648807994581188611

I should do more forecasting again

@rime
Always Less Dignified™

Network epistemology — sounds really nice :-) Perhaps that's what CoEms are getting at