Message from @radeon
Discord ID: 384497614193819672
I'm looking at the guys tabs
Wikipedia page for "Wild Cabbage"
stardew valley
wait
nvm
I know what philosophy is I'm not saying it's invalid it just isn't scientific
It's speculation
wut
No, philosophy isn't science. It's not non-science either.
It's principles you use to think and communicate. You need them to do science, you need them to reason, to do politics, even to do arts.
Yes, ancient philosophers thought they could figure out nature by just thinking really hard about it.
That part wasn't science.
I can figure out nature by thinking really hard about it.
Yes but the second you start actually forming legitimate hypothesis with fail and success states that follow the scientific method you are no longer doing philosophy
Maybe you're outside of the inane endless struggle of humanity.
Philosophical ideas need not be necessarily unscientific but they are speculation by definition
Logic still came from philosophy.
Ok, but that doesn't mean it's science
Logic isn't science.
But you better derive your scientific conclusions with logic.
Philosophy was also important in figuring out that seemingly logical constructs can construct absurd inquiries. We call them paradoxes.
In Computer Sciences, this shows up as undecidable problems.
e.g. "I'm lying"
I'm not quite sure how to respond, because it obviously depends on the subject matter and also - whether we like it or not - how you've grown to interpret "paradox", but I've never considered undecidable problems in computing to be paradoxes at all
to me, a paradox is when you start with a reasonable preposition or whatever, and then the conclusion is not what you'd expect
roughly speaking
Undecidable problems are questions that describe problems in a way that make them appear answerable, but they aren't.
oh, then we disagree on what an undecidable problem is
"An algorithm that can check if a program enters an infinite loop or eventually stops."
right
that's not a paradox
the conclusion is entirely what I expect
Since the only way to know what happens is to actually run the program, the algorithm analyzing the program has to compute the same thing as the program itself. Therefore, analyzing is the same as computing.
So if it enters an infinite loop, the analysis will also loop, and therefore you'll never get an answer.
So the question really was, can we know the final result of a computation without running the computation?
The proof is actually very lengthy.
I'm not sure, should I just repeat myself?
>A paradox is a statement that, despite apparently sound reasoning from true premises, leads to an apparently self-contradictory or logically unacceptable conclusion.
this might appear like a paradox to someone who doesn't know the subject matter, but like I said, the conclusion to this algorithm is entirely expected for me
Probably every paradox can be reworded in a way that makes the contradiction in the question evident.