I am now watching a 6 minute YouTube video on Wittgenstein. Let me know if you have any questions about the man or his philosophy. I will be happy to answer them.
-
Show this thread
-
-
Replying to @muralipiyer
1. We use language as a means to create pictures in the minds of others, and errors in communication are due to mismatch in the pictures. (Tractatus Logico-Philosophicus)
1 reply 1 retweet 1 like -
Replying to @CholericCleric @muralipiyer
2. We use language as a "tool" for specific "games" we are playing. Errors occur when others fail to see what is the game. (Philosophical Investigations)
1 reply 1 retweet 1 like -
Replying to @CholericCleric @muralipiyer
My take: Computer science people almost intuitively understand this. Which is why they invented precision in the way things need to be communicated. Because things from the work of people like Wittgenstein and Derrida percolated into our discipline.
1 reply 0 retweets 1 like -
Replying to @CholericCleric
I don't know. I think we were more obsessed with ambiguity after our earlier attempts at self-modifying code put us in lots of trouble. We just couldn't keep track of all things. Same thing is happening with AI now. We don't like a piece of code if we can't predict its behaviour.
1 reply 0 retweets 0 likes -
Replying to @muralipiyer @CholericCleric
Probably time to ask
@Plinz about his insights. The question is: Why do ppl in computer science have well defined communication protocols.2 replies 0 retweets 0 likes -
Replying to @muralipiyer @CholericCleric
Wittgenstein tried to invent computer science in the Tractatus. He got very far and even knew that you can do everything with NAND gates!
1 reply 0 retweets 1 like -
Replying to @Plinz @CholericCleric
You mean he did all the binary logic? Nand gates was a pretty difficult thing for me. I never understood during my ug days why we needed to study and, or, not if Nand can do all three.
1 reply 0 retweets 0 likes -
Replying to @muralipiyer @CholericCleric
The Church Turing thesis is the insight that Boolean logic, Lambda calculus (Lisp), Turing machine and whatever all have exactly the same power. And our computers are built completely from NOT-AND gates.
2 replies 1 retweet 1 like
You can make all Boolean logic just using NAND. NOT a = a NAND a. a AND b = NOT (a NAND b) a OR b = (NOT a) NAND (NOT b) etc. (if I just got it right before falling asleep)
-
-
Replying to @Plinz @muralipiyer
This is too much boolean algebra for me, even when I am wide awake.
2 replies 0 retweets 0 likes -
Replying to @CholericCleric @muralipiyer
No, it’s very simple and you do it already. When you use the words “and”, “or” and “not”, or their combinations, such as “not … and …”—Just observe your own thinking while doing it!
0 replies 0 retweets 1 like
End of conversation
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.