d2841 - 5d
#Wordle 1,437 5/6 β¬β¬π©β¬π¨ β¬π¨π©β¬π© β¬β¬π©π©π© β¬β¬π©π©π© π©π©π©π©π©
I should have had it in 2! If only I'd listened to my intuition.
Yeah, that's what I was saying. Wasn't shouting it
Oh actually I was confusing it with yesterdays. I should have had it in 4 maybe...
You know much computability theory? Turing machines etc? Random question I know
I'm surprised they don't seem to sneak weekly themes in. Haven't noticed any anyway
Ah ok, was only asking cuz I was gonna share a couple random things I learned lately. Prob not worth explaining if don't know the basics though. What do you mean by optimal set in this context? Do you mean minimal set of functions from which complete set of maps can be made using some combos? As in, for binary logic, you can write everything as AND and NOT (two functions).
May have to get back to you on it when have more time. Busy Beaver problem was what I wanted to share. Construction of uncomputable function that's constructive rather than the usual diagonilation type argument. But to appreciate it requires the basic definition/formalization of Turing machines which is a few pages
There was something else too, but forgetting what it was now
Second paragraph is impregnable to my smol brain. Maybe you're using N lazily, and you mean smaller set to a bigger one?
Road trip ahead of me so will return
Don't make me write your name in the notebook ποΈβ οΈ
d2841 - 4d
Just for completeness, revisited this in hopes of getting gist but don't think I've succeeded completely. Oh well. Lemme know if you advance further and maybe then I'll press you for a coherent explanation π€
This is pretty odd, but I'm only seeing this note on notedeck now, and if i go back to my phone i don't see it in our conversation history
Oh, nm, I see I was not mentioned in reply. Carry on
Came here to say, that while I still don't know much of what you're talking about, an idea popped into my head which has a remote chance of being useful to you (big maybe). Do you know about even/odd transpositions in context of groups, symmetric groups of all permutations to be exact? A bit rusty, but think it can be shown all permutations can be generated by transpositions, and all permutations can be classified as either even or odd (based on some property I can no longer recall). If that sounds at all relevant, have a look
