So you are doubling down claiming I said something I never said, after I pointed out to you that I didn't say it. Well have a nice day then.
Tarski Undefinability Theorem Succinctly Refuted
Re: Tarski Undefinability Theorem Reexamined
Well you will forgive my faulty inference. You were unhappy with my claim that physics can explain meaning and challenged me to "do better".
I have no idea what that means.
Good day to you too. Unless you care to clarify.
Last edited by Logik on Sat Apr 06, 2019 8:37 pm, edited 1 time in total.
Re: Tarski Undefinability Theorem Reexamined
Well, I don't know. Both of you "grown people" seem to be arguing that meaning is not in the realm of physics.
OK then. So meaning is uncaused. Go forth and chase your tail about the ontology of "meaning" like every other philosopher.
Meaning is a consequence. Like every fucking thing in this universe.
It just so it happens - it's a consequence that takes place in your brain.
Last edited by Logik on Sat Apr 06, 2019 8:41 pm, edited 1 time in total.
Re: Tarski Undefinability Theorem Reexamined
But you did not claim that. You claimed that bit flipping -- computation -- can explain meaning.
So now you are claiming not only that I said something I never did; but that you said something YOU never did.
Re: Tarski Undefinability Theorem Reexamined
I didn't claim that?
Firstly bit-flipping is an instance of computation. In particular digital (boolean) computation.
Which suggests that your conception and my conception of what "computation" is are vastly different
Lambda calculus is computation. It's conceptual first. Bit-flipping is implementation/realization detail.
OK. You want to drag this into the mud clearly.
Only - I am not interested.
Re: Tarski Undefinability Theorem Reexamined
I did so several times. Can't help you anymore. Why don't you just carefully re-read the thread? You'll see clearly where you put words in my mouth that I never said; and where I specifically corrected you. And where you then repeated your misrepresentations. And then where you misrepresented your OWN words, pretending you had said things you did not say.
Re: Tarski Undefinability Theorem Succinctly Refuted
Your false accusation of "disingenuity" is absent of a phenomenological or meta-cognitive consideration.
Because "the experience brings back memories" sure has a lot of parallels to to this: https://en.wikipedia.org/wiki/Recall_(memory)
Recall in memory refers to the mental process of retrieval of information from the past. Along with encoding and storage, it is one of the three core processes of memory.
Accusing me of mis-representing your words is one thing. It's possible that I misunderstood - it happens.
Pretending that you can detect when I "misrepresent" myself when I speak about my own meta-cognitive processes is a whole new level
I am out of this dick-measuring contest. Enjoy.
Re: Tarski Undefinability Theorem Reexamined
You are mistaken Conceptually the fields of computation, physics and mathematics are isomorphic.
Church–Turing–Deutsch principle
Lambda calculusA universal computing device can simulate every physical process.
Curry-Howard correspondenceLambda calculus is a universal model of computation
Do you need me to connect the dots for you?The Curry–Howard correspondence is the direct relationship between computer programs and mathematical proofs.
Digital physics
Physical information
I cared (past tense) precisely because I was trying to have an intelligent conversation with somebody who seemed capable of it, but you sure went out of your way sabotaging the conversation with false accusations.
I think you owe me an apology? Won't be holding my breath though.
Re: Tarski Undefinability Theorem Reexamined
Nonsense.
That is a BELIEF and not a FACT. Surely you know this.
I reiterate my earlier statements. You repeatedly mischaracterized what I said. The best I can do here is change the word lie to mischaracterize.
Bottom line is that if you believe the world is a Turing machine then you would hold your set of beliefs.
I have no problem accepting that you hold the truth of the CTD thesis.
But for you to pretend it's a law of nature and not someone's conjecture is disingenuous.
Re: Tarski Undefinability Theorem Reexamined
Sure. In exactly the same way Evolution is a belief and not a fact.
Oh! Oh! But evolution is a physical process.
And all physical processes can be simulated on a Turing machine.
Which is why we have cellular evolutionary algorithms: https://en.wikipedia.org/wiki/Cellular_ ... _algorithm
And in general Evolutionary computation algorithms: https://en.wikipedia.org/wiki/Evolutionary_computation
So I guess Evolution is evidence FOR the CTD "belief" then?
Seriously? All we have in science/physics are well-substantiated and polished conjectures.
All "laws of nature" are on borrowed time until a more complete theory comes around. Hello Newton's "law" of universal gravitation.
Bottom line is that ALL claims about what the world IS are ontological nonsense. Nobody has a fucking clue what the world IS.
I conceptualize the world (and therefore my mind) as a Turing machine. Did you suddenly forget that all truth is semantic?
-
- Posts: 1554
- Joined: Mon Jul 25, 2016 6:55 pm
Re: Tarski Undefinability Theorem Reexamined
I understand that is the most conventional way of looking at it, yet not the only way.Logik wrote: ↑Sat Apr 06, 2019 7:13 amBut you do understand that the expression/representation of strings is just language, right?PeteOlcott wrote: ↑Sat Apr 06, 2019 4:24 am When one assumes that certain symbols are tied to specific logic resolution
algorithms then symbols are merely infix notation for functions on strings.
In theory this could all be translated into Lambda Calculus equivalents.
In foundations of mathematics, philosophy of mathematics, and philosophy of logic, formalism is a theory that holds that statements of mathematics and logic can be considered to be statements about the consequences of the manipulation of strings.
And language itself has no intrinsic meaning e.g semantics until interpreted.
it is possible to merge the Tarski Meta-language and object language into a
single language that essentially interprets its own semantic meaning.
For example the current set of human knowledge could be encoded entirely
as relations between integers. When a human language is mapped to these
relations a human could talk to this omniscient machine. The machine would
still know what it knows entirely on the basis of its relations between integers.
Re: Tarski Undefinability Theorem Reexamined
Yes. This is what every programming language does.PeteOlcott wrote: ↑Sun Apr 07, 2019 3:35 am I understand that is the most conventional way of looking at it, yet not the only way.
it is possible to merge the Tarski Meta-language and object language into a
single language that essentially interprets its own semantic meaning.
Self-compiling compiler
You said you come from a computer science background, so I am not sure why you think this is new knowledge? Inventing/compiling your own language has been part of undergrad computer science coursework for decades.
Last edited by Logik on Sun Apr 07, 2019 9:13 am, edited 1 time in total.