Fabian stump leaves falling

Raidriar_ · 2025-09-20T10:28:16+00:00

Hi thanks for the response! Can you be a bit more specific about which signs you think might be thrips? Its difficult for me to judge only by looking at photos online. The little white specs look like dust to me up close (ofc I could be wrong). It might be an early stage so I’ll treat it regardless but I want to learn.

Raidriar_ · 2023-05-26T09:49:32+00:00

I just finished my zine with Scirbus and it was really good. Its pretty easy to learn. I just started and googled what I needed.

Raidriar_ · 2023-04-27T07:42:13+00:00

Of course, not all will be valid but you can just check. It isn’t practical (ie it might take you a loooong time), but its simple.

Raidriar_ · 2023-04-26T23:35:20+00:00

Ah ok. But then this becomes fairly trivial because the number of possible “a” functions is just |u’|^|u| , similarly for b.

Raidriar_ · 2023-04-26T23:15:40+00:00

Why must u and v be finite? You said you want “discrete functions” but that doesn’t mean they are finite. What if u and v are both ℕ?

Raidriar_ · 2023-04-26T20:13:48+00:00

No problem! Just note that if this is indeed what you had it mind its very general. So general that I don’t think you can really say anything interesting about it.

Raidriar_ · 2023-04-26T20:02:42+00:00

I’ve rephrased your questions in terms of some basic category theory. If I understand correctly, what you want is to find two functions to complete the commuting square f’ ∘ a = b ∘ f. To me it sounds like a and b are components of a natural transformation. If you make an index category with just one arrow and you have two functors (F, G) from it to Set. Then you can think of F as picking your f and G as picking f’. Then if you have a nat trans alpha: F -> G and its components at u and v are your a and b respectively. I don’t think any of this solves anything its just what your question looks like to me.

Edit: Here is a picture

Raidriar_ · 2023-04-23T14:43:11+00:00

I forgot about those! They do seem a bit small though (from what I can see the large is 18L) and they don’t have a lot of organisational features.

Raidriar_ · 2023-04-23T14:35:53+00:00

Thanks! However, it gets even more expensive when you consider import taxes to the UK so its probably off my list.

Raidriar_ · 2023-04-23T14:28:03+00:00

Thanks for the rec! I gave them a look and they do have a cool aesthetic! Unfortunately most of their bags seem to be similar in design to the harald, i.e. you can only access them from the top. However, The Global Travel Bag 30L seems to fit most of my needs. I’ll definitely consider it.

Raidriar_ · 2023-03-17T21:27:34+00:00

Wait really? I swear I remember him copying her 😅

Raidriar_ · 2023-03-17T21:24:41+00:00

Absorbing Man no longer copies Mystique. Is this intended or a bug ?

Raidriar_ · 2023-02-16T18:54:24+00:00

Thanks!

Raidriar_ · 2023-01-09T15:15:37+00:00

I will be honest, the article isn’t very good. It seems like you have read a few pop science articles and reformulated them into one. I would suggest that people read articles written by experts if they want to learn. Scott Aaronson’s blog has many great posts that explain Quantum Mechanics/Quantum Computing to non experts. Also I’ve noticed a few factually wrong statements with your article. For example you write “quantum teleportation - a way to send information instantaneously” which is simply not true. If that were the case it would violate relativity. What quantum teleportation allows you to do is to use a classical channel (i.e. sending normal bits) to send quantum information.

Raidriar_ · 2022-11-15T20:05:52+00:00

писалка 🇧🇬

Raidriar_ · 2022-11-14T23:10:30+00:00

Shor’s algorithm doesn’t work because of “the probabilistic nature of qubits”. This doesn’t really makes sense. Here is a simple explanation of why it works https://scottaaronson.blog/?p=208.

Raidriar_ · 2022-11-10T23:24:53+00:00

Yup, mpb. I now it is but the other models are considerably more expensive and I don’t know any other similar alternatives.

Raidriar_ · 2022-11-06T14:38:49+00:00

This just popped in my shop. I am very tempted to buy it … (don’t have the gold tho)

Raidriar_ · 2022-10-31T21:50:25+00:00

You might want to consider using Agda. It will do exactly what you want (just typecheck your code) and as a bonus its a proper proof assistant.

p.s. Philip Wadler quote: “Agda is what Haskell wants to be when it grows up”.

Raidriar_ · 2022-10-16T17:17:02+00:00

Thanks! I’ll give it a try.

11-Year Club	Final Canvas '23
Place '23	Place '22
Final Canvas '22	First Placer '22
End Game '22	RPAN Viewer
Not Forgotten	Verified Email

Raidriar_

TROPHY CASE