>>12104086>>12104155Please excuse how long my reply took as I was doing my best to condense it into 2,000 characters.
Also note that the word 'compute' comes from the Latin word computare, meaning "arithmetic, accounting, reckoning". Meaning that Gödel, or any arbitrary mathematician, can simply state things that are unprovable and rely on exhausting their current and future audiences by saying, "I am a mathematician and you cannot compute the z-index of my nth root of unity, which is an imaginary number that is so large that the recursive function required to compute the value has to encounter a stack overflow as a precursor to the true value being revealed: The true value being the lack of my patience in being anyone's whipping boy as I'm the one that wields the analog whip that created the digital recursive function in the first place."
>Algorithms + Data Structures = ProgramsI'll define the recursive function here:
other_people's_bullshit_they_think_I_care_about_but_I_just_wanna_get_paid_and_laid = string = s
string can also be any given word (or keyword if your a cryptography enthusiast) or just 'string' because it is an analytical result we have to provide otherwise there are no args for us to parse.
2 here would be at a minimum allowing two computations threads to process the function, allowing it to be pipelined or computed in parallel (meaning fast).
s would be the given word or problem we are trying to reduce for other people
-1 would be the loop variable i (meaning the reason for why we would want to loop over anything or draw a circle or whatever geometry)
and + 1 would be the stick we hit ourselves over the head with so we don't bloat our own reasons for blathering on to a computer (meaning why the fuck would I ever bother trying to computer + 1 myself unless it is related to some successor function or predicate clause(s) that require conjunction.
Basically + 1 is a language problem that is reduced via demos.
