← Home ← Back to /sci/

Thread 16712381

15 posts 4 images /sci/
Prince Evropa No.16712381 [Report] >>16712435 >>16712471 >>16712498 >>16712507 >>16712522 >>16712976 >>16713005
Computer Algorithms
What kind or level of math do computer algorithms usually use?
Anonymous No.16712435 [Report] >>16712471 >>16712477
>>16712381 (OP)
Anything not covered by collegiate GE courses is only used to make video game graphics or to spy on you.
Anonymous No.16712471 [Report] >>16712477
>>16712381 (OP)
90% of anything you're likely to encounter is either basic boolean logic or linear algebra. Like >>16712435 said, anything more rigorous or difficult is only gonna pop up in fields like visual effects, game design, data security, etc.
Anonymous No.16712477 [Report]
>>16712471
>>16712435
Thanks. What algorithms can be used to spy on me?
Anonymous No.16712498 [Report]
>>16712381 (OP)
computer science and discrete math
both are challenging subjects
Anonymous No.16712507 [Report] >>16712526 >>16713008
>>16712381 (OP)
It’s not really math. Just first-order predicate logic. If that’s math, then philosophy is technically math too.
Anonymous No.16712522 [Report] >>16712603 >>16712729
>>16712381 (OP)
If code itself was more understandable to me than these logic charts am I retarded or am I smart?
Maybe it's my ADHD zoomer brain but pseudocode is more readable/digestible than a bunch of shapes strewn everywhere.
Anonymous No.16712526 [Report]
>>16712507
philosophers try so hard to be relevant
Anonymous No.16712603 [Report] >>16712622
>>16712522
Loops and control flow are a code smell
Anonymous No.16712622 [Report]
>>16712603
turns out computers don't run on pure math
Anonymous No.16712729 [Report] >>16712755
>>16712522
Code has significantly higher density than flowcharts. I feel the same, but to people who can't read code, flowcharts are more digestible.
Anonymous No.16712755 [Report]
>>16712729
>but to people who can't read code
If you can't read code can you ethically be considered a human "being?"
Anonymous No.16712976 [Report]
>>16712381 (OP)
The algorithms I write for a living are not provably total in second-order arithmetic, but they are in, say, ZF.
Anonymous No.16713005 [Report]
>>16712381 (OP)
algorithms are usually analyzed in an undergrad course by reducing each step in the algorithm to some value and then discarding the constant-valued terms, the point being to single out loops and other input-dependent paths, which form a polynomial whose degree is essentially the upper bound on the time complexity otherwise known as the asymptotic complexity or the 'big oh' value of the algorithm. so the actual math involved is basically just college algebra. this is the main topic of chapter 1 of introduction to algorithms or CLRS.
Anonymous No.16713008 [Report]
>>16712507
how does predicate logic relate to computer algorithms retard