3 ms·
>>>> One abstraction that is very useful is linear algebra which is an abstraction without errors. >>> Bullshit. Your claim that there is no abstraction error
by random314 4y ago
>>>> One abstraction that is very useful is linear algebra which is an abstraction without errors.
>>> Bullshit. Your claim that there is no abstraction error in linear algebra (when run on computers - we're in subdiscussion related to programming) is false
>> You fail to realise that we can prove theorems about linear algebra
USING COMPUTERS
> Obviously I realize we can prove theorems. If I didn't realize it was possible to prove things
You have been arguing in bad faith by either putting words in my mouth (when run on computers) or deleting key phrases from my reply (USING COMPUTERS - reinserted by me)
These 2 statements by you contradict each other
"Bullshit, Your claim that there is no abstraction error in linear algebra (when run on computers - we're in subdiscussion related to programming) is false
"
"
Obviously I realize we can prove theorems" -----> USING COMPUTERS
It is clear that you thought of computers as IEEE floating point number crunching machines, with implicit floating point errors. All of your arguments rested on this irrelevant point. You even condescended to teach me about floating points using citations not needed by anyone who has attended CS101.
You failed to realize that finite sized representations of computable real numbers exist, by definition[1]. One such representation could be a finite sum on surd basis, instead of using a binary basis eg sqrt(2) instead of 1.414.... and the most general form is a theorem prover like Lean.
All of these misunderstandings in your head because you failed to realize the gist of the Church Turing thesis ' - Everything that you do with your brain and paper can be duplicated on a computer.
In any case, I am glad you learned something today. Computers don't relate to math via IEEE floating pointing numbers, the connection is a lot deeper[1]. You won't acknowledge this, but frankly speaking, I can't really stand out- jargoning pretending to be an honest discussion. I did give an opportunity to you to correct yourself with my first comment. But you only doubled down - more jargon, bad paraphrasing of diagonalization, putting words in my mouth, followed by removing key phrases from my replies amongst other bad faith arguments.
[1]
https://en.wikipedia.org/wiki/Church%E2%80%93Turing_thesis https://en.wikipedia.org/wiki/Church%E2%80%93Turing_thesis
To establish that a function is computable by Turing machine, it is usually considered sufficient to give an informal English description of how the function can be effectively computed, and then conclude "by the Church–Turing thesis" that the function is Turing computable
- JoshCole 4y agoI made the claim that problem simplification through an abstraction that has error can reduce computational complexity leading to improved solution quality. You responded by talking about people who are talking about Lagrange points. I found that extremely insulting. I still find you to be extremely insulting. I don't think my claims are so hard to understand. I find your intentional misinterpretation of my points annoying. I despise that you lied about whether we were talking about learning and abstraction. I don't like talking with people who blatantly lie. I consider lying bad. I also dislike that you misquoted me. You put quotes around words I didn't say. I didn't do that to you. You say that I did. You lie when you say that. I gave you my interpretation of what I felt you were claiming. I even explained why I felt you claimed that. This wasn't under the quote symbol. Yours was inside quotes. Yours was a lie. Mine had your original quote, unaltered, with my interpretation below it. I was in error. I admit that. I was trying to get at the heart of my point - that erroneous abstractions aren't inherently bad. Outcome error is much more important than input error. I don't agree that you've taught me anything - you just try to call me incoherent because what I'm saying is true but you employ motivated reasoning to avoid having to refute it. If you actually understood what I'm saying - which obviously you don't, which is a big part of the problem here, you would agree with me. Or at least, I think you would. That simple problems are easier to solve and sometimes an actual solution is better than no solution really isn't that complicated a thing. Or controversial. I'm sure plenty of people understand it. There are so many times in life where my point holds. The use of floating point is one. Perhaps you didn't notice that ML engineers frequently choose to move from float64 to float32 to float16 to float8? Perhaps you didn't notice that services all throughout the computing industry choose to meet an SLA, minimizing latency sometimes at the cost of optimal solutions whose computation isn't realistic given their computing budget. I don't know. But you're definitely not actually teaching me anything. Your just not understanding me. So this conversation is pointless. I'm still just as convinced of the truth of the idea that it can be very wise to accept a bad abstraction, one that has error, rather than a perfect abstraction. I can't even fathom how to go about the opposite. How would a child go from knowing nothing to knowing everything perfectly without moving through areas of bad abstraction along the way? I feel you are mean. I'd rather we stop talking about this together if we're not going to actually engage with each other on the topic under discussion.
- 4y ago