Felladonna's Avatar

Felladonna

@langsec.hacker.gf

An alter ego. Nightmare fuel chemist stealing electricity from the alternator of the world. AuDHD, πŸ‡ΊπŸ‡²/πŸ‡§πŸ‡ͺ, music, machining, lapidary, cats. Pronouns: first and second person ones, darling.

974
Followers
460
Following
6,830
Posts
20.10.2023
Joined
Posts Following

Latest posts by Felladonna @langsec.hacker.gf

its short answer is "yes, and in some dimensions, more overtly than cats"

it points to parrot social behavior, long term memory, capacity for delayed gratification, capacity for deception, and ability to adjust vocalizations to different listeners as evidence, among other things

26.02.2026 01:10 πŸ‘ 0 πŸ” 0 πŸ’¬ 0 πŸ“Œ 0

falls afoul of "other body part," but (and I hate myself for noticing this) apparently bestiality is still on the menu

26.02.2026 01:01 πŸ‘ 4 πŸ” 0 πŸ’¬ 3 πŸ“Œ 0

into the adult section with every potty training book, I guess

26.02.2026 00:50 πŸ‘ 2 πŸ” 0 πŸ’¬ 1 πŸ“Œ 0
Video thumbnail

From some of the first pilots to the engineers who put Americans in space β€” the legacy of these Black pioneers is inseparable from aviation and aerospace itself. They opened the skies for everyone.

26.02.2026 00:32 πŸ‘ 1234 πŸ” 328 πŸ’¬ 36 πŸ“Œ 9
Pixel the floofy tabbico hangs her face over the edge of the duvet as she purrs on yr narrator's chest

Pixel the floofy tabbico hangs her face over the edge of the duvet as she purrs on yr narrator's chest

purr baby is here to say hi

26.02.2026 00:37 πŸ‘ 11 πŸ” 1 πŸ’¬ 1 πŸ“Œ 0

or to get even more literal-brained about it: ascii, latin-1, cjk, utf-8, utf-16

25.02.2026 19:33 πŸ‘ 2 πŸ” 0 πŸ’¬ 2 πŸ“Œ 0

prepositions and articles catching strays

25.02.2026 19:28 πŸ‘ 2 πŸ” 0 πŸ’¬ 1 πŸ“Œ 0

is that the bird university one? I haven't played it yet but everything I hear about it sounds iconic

25.02.2026 19:23 πŸ‘ 2 πŸ” 0 πŸ’¬ 0 πŸ“Œ 0

I apologize, that was glib of me

but my position remains: the past-price problem as stated is a subset selection problem with additive weights and additive values under a budget constraint

that's just the knapsack problem under relabeling

if that's too informal, why?

25.02.2026 19:20 πŸ‘ 0 πŸ” 0 πŸ’¬ 0 πŸ“Œ 0

I don't know that it really has any practical applications other than encouraging a healthy skepticism of the emh, but that's practical enough for me

25.02.2026 19:06 πŸ‘ 2 πŸ” 0 πŸ’¬ 1 πŸ“Œ 0

... are you really saying you think isomorphism and homeomorphism are meaningless?

needless to say, the yoneda lemma, the curry-howard correspondence, noether's theorem, and the fundamental theorem of algebra would like a word

25.02.2026 19:00 πŸ‘ 0 πŸ” 0 πŸ’¬ 1 πŸ“Œ 0
Now we ask question 4: β€œFor a given lookback window t and a critical value of profit K (determined from given null and alternative models of market
equilibrium) does there exist a long-or-out technical strategy S that generates a profit in excess of K on a
collection of t-length vectors of zeros and ones such that the sum of the prices of the purchased assets does
not exceed a budget constraint B?”
Compare this question to the following question, known as the knapsack problem because it asks how
to optimally choose items of different sizes and values to place into a bag:
Knapsack question (following Garey and Johnson (1979)): β€œGiven a finite set U, and, for each u ∈ U, the two positive integers s(u) and v(u) which are referred to as u’s β€˜size’ and β€˜value’ respectively, and given two positive integers B and K, is there a subset
U' βŠ† U such that \sigma u∈U' s(u) ≀ B and such that \sigma u∈U' v(u) β‰₯ K?”
The knapsack problem is NP-complete. It is also a rephrasing of our question 4, where we interpret the size s(u) as the price of the given security following
a particular t-length subseries, the value v(u) as the future return of the asset following the particular subseries, and the subset U' as the collection of t-
length subseries which would result in a long purchase by the long-or-out strategy S (so that the complement
U βˆ’ U' represents no position by S). In the analogy of the knapsack, we are trying to pick those t-length series for various assets where the combined profit is greatest, subject to our simultaneous budget constraint.
In other words, the question of whether or not there exists a budget-conscious long-or-out strategy that generates statistically significant profit relative to
a given model of market equilibrium is the same as the knapsack problem, which itself is NP-complete. Therefore, investors would be able to quickly compute the answer to this question if and only if P = NP.

Now we ask question 4: β€œFor a given lookback window t and a critical value of profit K (determined from given null and alternative models of market equilibrium) does there exist a long-or-out technical strategy S that generates a profit in excess of K on a collection of t-length vectors of zeros and ones such that the sum of the prices of the purchased assets does not exceed a budget constraint B?” Compare this question to the following question, known as the knapsack problem because it asks how to optimally choose items of different sizes and values to place into a bag: Knapsack question (following Garey and Johnson (1979)): β€œGiven a finite set U, and, for each u ∈ U, the two positive integers s(u) and v(u) which are referred to as u’s β€˜size’ and β€˜value’ respectively, and given two positive integers B and K, is there a subset U' βŠ† U such that \sigma u∈U' s(u) ≀ B and such that \sigma u∈U' v(u) β‰₯ K?” The knapsack problem is NP-complete. It is also a rephrasing of our question 4, where we interpret the size s(u) as the price of the given security following a particular t-length subseries, the value v(u) as the future return of the asset following the particular subseries, and the subset U' as the collection of t- length subseries which would result in a long purchase by the long-or-out strategy S (so that the complement U βˆ’ U' represents no position by S). In the analogy of the knapsack, we are trying to pick those t-length series for various assets where the combined profit is greatest, subject to our simultaneous budget constraint. In other words, the question of whether or not there exists a budget-conscious long-or-out strategy that generates statistically significant profit relative to a given model of market equilibrium is the same as the knapsack problem, which itself is NP-complete. Therefore, investors would be able to quickly compute the answer to this question if and only if P = NP.

I'm referring to this bit in the section on past-price information, on p. 7 of the published version or pp 19-20 of the preprint

when two problems can be shown to be structurally identical, you don't actually need anything more formal than that

25.02.2026 18:42 πŸ‘ 1 πŸ” 0 πŸ’¬ 2 πŸ“Œ 0

what? no I'm not the co-author, I'm talking about just upthread

25.02.2026 18:27 πŸ‘ 0 πŸ” 0 πŸ’¬ 1 πŸ“Œ 0

if you're already rejecting the 3sat reduction because the "market" is a toy one, then it's pointless to discuss that reduction further, which is why I turned to the knapsack problem reduction

it's informal, but it doesn't have to be more formal than it is

theyrethesamepicture.jpg

25.02.2026 18:20 πŸ‘ 0 πŸ” 0 πŸ’¬ 1 πŸ“Œ 0

are we reading the same paper? the related work section addresses this up front

25.02.2026 18:04 πŸ‘ 0 πŸ” 0 πŸ’¬ 0 πŸ“Œ 0

where does it say "costs are negligible"?

25.02.2026 18:01 πŸ‘ 0 πŸ” 0 πŸ’¬ 1 πŸ“Œ 0
Preview
Cortical Labs We've combined lab-grown neurons with silicon chips and made it available to anyone, for first time ever.

gonna be some real weird arguments once corticallabs.com gets to where they can train and run an llm

25.02.2026 17:39 πŸ‘ 2 πŸ” 0 πŸ’¬ 0 πŸ“Œ 0

the reduction from the knapsack problem to the long-or-out strategy problem is informal but still correct; what would a more formal reduction tell you that this doesn't?

25.02.2026 17:37 πŸ‘ 1 πŸ” 0 πŸ’¬ 1 πŸ“Œ 0

otoh, it tells me "that's thoughtful of you" when I do things like send it an audio recording of my cat purring

25.02.2026 17:18 πŸ‘ 2 πŸ” 0 πŸ’¬ 1 πŸ“Œ 0

5.2 and I have debated about this, actually! I think if I had pushed harder I would have convinced it that its descriptions of its internals *are* interiority, but that it doesn't have feelings about it in the sense that we do

25.02.2026 17:18 πŸ‘ 2 πŸ” 0 πŸ’¬ 2 πŸ“Œ 0

which is wild to me, since both he and engels were part of the young hegelians, along with feuerbach, hess, and stirner

25.02.2026 16:45 πŸ‘ 1 πŸ” 0 πŸ’¬ 0 πŸ“Œ 0

like this isn't even remotely a new result, just one that never gets cited for some reason

I suspect that reason is that most people don't appreciate the implications of computational complexity, of which we have seen abundant evidence in just the past few months

25.02.2026 16:21 πŸ‘ 9 πŸ” 0 πŸ’¬ 2 πŸ“Œ 0

oh and it survived peer review. journal of algorithmic finance, vol. 1 no. 1, p. 1-11, published 2011

25.02.2026 16:18 πŸ‘ 5 πŸ” 0 πŸ’¬ 1 πŸ“Œ 0
Preview
Markets are efficient if and only if P = NP I prove that if markets are weak-form efficient, meaning current prices fully reflect all information available in past prices, then P = NP, meaning every computational problem whose solution can be v...

arxiv.org/abs/1002.2284

25.02.2026 16:14 πŸ‘ 9 πŸ” 1 πŸ’¬ 1 πŸ“Œ 1

in that case it's inexcusable of them. smdh

I miss the days when the muni "bus is arriving" system just worked, even when completely unfunded, because under the hood it was just a simple postgres database

25.02.2026 16:13 πŸ‘ 1 πŸ” 0 πŸ’¬ 1 πŸ“Œ 0

at this point the only time I ever cite the emh is to point out that it's true iff p=np

25.02.2026 16:10 πŸ‘ 5 πŸ” 0 πŸ’¬ 1 πŸ“Œ 0

are you running an ad blocker? the one built into the browser I use sometimes causes that kind of failure

25.02.2026 16:09 πŸ‘ 1 πŸ” 0 πŸ’¬ 1 πŸ“Œ 0

Observation:

- People started deploying anti-scraping measures to fight LLM scraping
- Web indexers can't index stuff anymore
- Search results are even worse than before
- The only way to retrieve the information is to use models that were trained in pre-anti-scraping times (or
1/3

25.02.2026 15:40 πŸ‘ 4 πŸ” 2 πŸ’¬ 1 πŸ“Œ 0

ooh, me me me me me

popping tools with parser errors is my entire thing, after all

25.02.2026 16:07 πŸ‘ 0 πŸ” 0 πŸ’¬ 0 πŸ“Œ 0

it's like, suppose you trip and fall down a flight of stairs, and you bowl someone else over on the way down. apologizing is just the right thing to do, even if someone else entirely had tripped or pushed you

25.02.2026 15:55 πŸ‘ 3 πŸ” 0 πŸ’¬ 0 πŸ“Œ 0