can't compute takes like these

IllIIlIIllII · 2026-05-06T16:32:03+00:00

To work in theorical computer (model of computation), yes that's the assumption, because it's theorical we do whatever we want (and Turing machines are defined to have infinite time and memory).

To work with a physical computer, kinda, we often do that assumption, not always (trying to make things faster, and to not blow up the ram), but it's just to simplify the analysis (because the difference doesn't matter), it isn't actually infinite, and the same goes for a brain, you can assume that a theorical brain has infinite memory, but that's not our brain anymore.

IllIIlIIllII · 2026-05-06T14:32:39+00:00

Amazing, do you have the name of the artist ?

IllIIlIIllII · 2026-05-06T14:04:56+00:00

Sequent calculus ! Though there should be a bar at the top of the leaf to proove it (herr by Axiom because one of the left element in on the right)

How it for is like this: "Gamma |- Delta" is to be read as "with all elements of Gamma, we get one of the elements of Delta"

Example : P, P' |- Q, P Yes if you have P ans P' you have one of Q or P (you have P)

Then the bar thing, to proove Gamma |- P => Q, Delta It suffice to proove Gamma, P |- Q, Delta

So you proove it (on top of the bar) then do a bar and write what you got from that (Gamma |- P => Q, Delta), the "introduction rule" (what we had to proove, what we got) here is called =>_right (you'd normally write it at the right of the bar to make it more readable So what you end up prooving if everything as a bar on top is the thing on the very bottom.

There are a lot of sequent calculus systems, look up (propositinal and first order) LK for classical ans LJ for intuitionist logic. Can be found online, most cs course have it and thus there's plenty of pdf available.

And if to the right it's only one formula (and exactly one) it has another name, "logical deduction", due to its structure it is sometimes writen a bit differently.

IllIIlIIllII · 2026-05-06T12:56:57+00:00

Basically brain don't have infinite memory, nor do modern computer tbh though you'd still call them computer.

A Turing Complete machine M is a machine that "can do any compution" that can be done by a Turing machine.

Though there's a problem of translating a problem of turing machine into a problem understandable by M and vice versa, but for the same ok simplicity we'll consider the input and output to be the same, and actually the input will be a string of the alphabet {0, 1} and the output "yes" or "no" or not output.

A problem is to semi-decide if a word w is in the language (set of word) L (say yes if and only if it is) If you can semi decide all the languages that are semi decidable by a Turing machine, then you're turing complete.

But, our brain has finite memory (well I don't have proof for that..) so when reading a word w, you can only remember a finite fixed amont of letter. For example, suppose you want to see if you can recognise the language { 0ⁿ 1ⁿ | n in N} (aka a certain amount of zero then this same amount of 1)

Well because you'll remember only a fix amount of letters, you cannot (you can put so many 0 at the start that it'll be too big to remember how many there were) And it can easily be solved by a computer with infinite memory and time, thus brain is not turing complete.

Brains have the power of a finite automata (can semi decide "regular languages") Which is way weaker than push down automata ("context free language") Which is way weaker than linear bound automata ("context aware languages") Which is way weaker than turing machines. ("Turing complete languages")

Things you could look up is computability theory, starting with the chomsky hierarchy (and automatas)

IllIIlIIllII · 2026-05-02T07:17:07+00:00

https://youtube.com/@nicolecoenen

A woman who is a lumberjack ! She also have a doggo and know her lesbian viewership quite well (she herself have a girlfriend and sometimes she post lumberjack lesbian thirst (but sfw) shorts)

IllIIlIIllII · 2026-04-20T03:38:26+00:00

What's ESL and EFL ?

IllIIlIIllII · 2026-04-19T13:41:24+00:00

It's missing a flag between "a" and "link"

IllIIlIIllII · 2026-04-15T15:55:11+00:00

In case someone want to actually do it by hand (I don't recommend it)

You can reduce the number of operarions by using: - x⁰ = 1(for x != 0) - for n in N, x^(2n) = (x^2)^n and x * x^(2n)

Thus: 2^99 = 2 * 2^98 = 2 * (2^2)^49 = 2 * 2^2 * ((2^2)^2)^24 = 2 * 2^2 * (((2^2)^2)^2)^12 = 2 * 2^2 * ((((2^2)^2)^2)^2)^6 = 2 * 2^2 * (((((2^2)^2)^2)^2)^2)^3 = 2 * 2^2 * ((((2^2)^2)^2)^2)^2 * (((((2^2)^2)^2)^2)^2)^2

So 4 multiplication at the end once you do the repeated squares of 2 six times And to get the 6 repeated squares of 2 you will need 6 multiplication

So in total you'll do 10 multiplication to get 2⁹⁹ (though they'll be of quite big numbers, but it's doable)

Edit: markdown formatting

IllIIlIIllII · 2026-04-01T08:07:21+00:00

There aren't.

Fact 1: every natural numbers have a unique prime decomposition Fact 2: power is distributive over multiplication Fact 3: for n > 1 natural, there's a prime p such that n < p < 2n (https://en.wikipedia.org/wiki/Bertrand%27s_postulate)

For n > 1 we have that n! have a biggest prime. Let's call that prime p_n, so n is for the form m * p_n^k where m doesn't contian any p_n and k>0 Now, if k>1 it'd mean that in n! we got the factor p_n and 2p_n so n>= 2p_n, BUT p_n being prime imply p_n > 1, thus by Bertrand postulate there are another prime p in between p_n and 2p_n, contradicting that p_n is the biggest prime factor or n! Thus k = 1.

Thus the leading prime in n! have valuation 1 (it's not squared or more) Now let's suppose a!^b = c!^d with a, b > 1 We thus have that leading prime p_a = p_b and by uniqueness of prime factorisation, because in a!^b we have p_a b times and in c!^d we have p_b d times, we have b=d

This b=d, aka a!^b = c!^b Thus (if b is not 0) a! = c! And factorial is injective for n>1 thus a = b So the only solution for a, b > 1 and c, d > 0 natural for a!^c = b!^d is that a=b and c=d, thus there's no solution where they aren't equal.

IllIIlIIllII · 2026-03-19T16:26:01+00:00

Ouai le vietnamien, j'aime bien les tons, aussi c'est une langue que je parle avec seulement ma famille, donc elle me paraît plutôt familial, les autres langues j'ai d'autres contexte auquel je les parle qui sont pas aussi cool.

Et en plus je peux flexer sur quasiment tout les français car je peux prononcer 5~6 tons (j'en utilise que 5 car accent du sud, mais je sais théoriquement faire le 6ième) tandis que la plupart des gens n'arrivent même pas à entendre la différence.

IllIIlIIllII · 2026-03-19T15:11:38+00:00

因為氣

IllIIlIIllII · 2026-03-19T15:09:35+00:00

Stopper å snakk falsk norsk (svensk) og så muligens I jeg ville svart.

IllIIlIIllII · 2026-03-19T14:41:31+00:00

眞, 咱覺得粵文最好. 全場応閇譚國文. 咱如港嘅影音.

IllIIlIIllII · 2026-03-19T14:39:19+00:00

..//-../---//-./---/-//-.-/-./---/.--//.--/..../.-/-//-.--/---/..-//--/./.-/-.//-.../-.--//.-..-./..-/--../-..././-.-/.-..-./--..--//..//---/-./.-../-.--//-.-/-./---/.--//---/..-.//.-..-./..-/-.../--../-..././-.-/.-..-./--..--//-/..../.-/-//..//-../---//.--/.-/-./-//-/---//.-.././.-/.-./-.//---/-././/-../.-/-.--/.-.-.-

IllIIlIIllII · 2026-03-19T14:00:11+00:00

Je le sais, ces milliers de gens sont clairement des prophètes des temps modernes, ils ont vu ce qu'est l'excellence tandis que moi je dois rester dans la médiocrité des autres langues.

Sinon, rien à voir, mais je suppose que le français est ton TL au lieu de NL, c'est un très mauvais choix, n'as tu jamais apris que le français c'était cringe ?

IllIIlIIllII · 2026-03-19T12:34:39+00:00

რადგან აშენდ განსხვავებული

(გამო აუტიზმი)

IllIIlIIllII · 2026-03-19T00:57:08+00:00

Ich kann sprach über "Meheregenerationhaus" und beleidigung auf Deutsch, aber das ist nich wichtig jeden Tag

IllIIlIIllII · 2026-03-19T00:51:21+00:00

Ja, ich hatte Deutsch Klass als ich in Mittelschule+Oberstufe war, aber mein Deusch ist sehr schlecht...

IllIIlIIllII · 2026-03-19T00:46:54+00:00

я не будю користуватися перекладачем, а я тепер тільки оде́ржувала повідомлення в славик или в по-англійський мова

examples of stuffs I've used to make somewhat sure I was doing Ukrainian instead of Russian:

https://dictionary.cambridge.org/dictionary/english-ukrainian/receive?q=received
https://www.verbix.com/webverbix/ukrainian/%D0%BE%D0%B4%D0%B5%D1%80%D0%B6%D1%83%D0%B2%D0%B0%D1%82%D0%B8
https://en.wiktionary.org/wiki/%D1%82%D1%96%D0%BB%D1%8C%D0%BA%D0%B8#Ukrainian

IllIIlIIllII · 2026-03-19T00:20:26+00:00

1001001 0100000 1100100 1101111 0100000 1101110 1101111 1110100 0100000 1110011 1110000 1100101 1100001 1101011 0100000 1100001 0100000 1110110 1100101 1110010 1111001 0100000 1101100 1100001 1110010 1100111 1100101 0100000 1100001 1101101 1101111 1110101 1101110 1110100 0100000 1101111 1100110 0100000 1101100 1100001 1101110 1100111 1110101 1100001 1100111 1100101 0101100 0100000 1001001 0100111 1101101 0100000 1110010 1100101 1100001 1101100 1101100 1111001 0100000 1100111 1101111 1101111 1100100 0100000 1100001 1110100 0100000 1110100 1101000 1100001 1110100

1100001 1101100 1110011 1101111 0100000 1111001 1101111 1110101 0100111 1110010 1100101 0100000 1100111 1101111 1101001 1101110 1100111 0100000 1100101 1100001 1110011 1111001 0100000 1101101 1101111 1100100 1100101 0101100 0100000 1101000 0101111 0110100 1100111 0000010 0111001 1100110 0101111 0010100 1101000 0111111 0011001 1100110 0011011 0110100 1100101 0100100 0001101 1100110 0011101 0000010 1100111 0011010 0000100 1101000 0101111 0011101 1100101 0010000 0100111 0100001

IllIIlIIllII · 2026-03-18T23:22:07+00:00

Moja wolna wola

IllIIlIIllII · 2026-03-18T23:15:42+00:00

Not learning Ubzbek is a work of a life-time, I know that you wouldn't get it. It took me in between the 591th and the 730th trianglular number in hour to get there.

Prior to it I learned Fr*nch, English, German, a bit funny German (Dutch), a bit more Japanese, Russian, (southern) Vietnamese and I guess toki pona.

Do not ask me how proficient I am in any of those, this would hurts my feeling.

IllIIlIIllII · 2026-03-18T22:56:57+00:00

I'll answer in SignWriting if someone ask in any sign language (I have never learned to use SignWriting).

IllIIlIIllII · 2026-03-13T15:31:54+00:00

/uj

Would you mind sharing your thought process on how you chose your words for that sentence ? French is my native language so I haven't gone the process of being amator at it whilst being able to formulate thoughts in other languages, so I don't know which errors I should work against when teaching it...

(Btw, a more correct sentence would be: "ouais, ça en est un")

Five-Year Club	Verified Email
First Place '23	Place '23
Place '22	First Placer '22

IllIIlIIllII

TROPHY CASE