Can you compute, without unjustified axioms, why that is a bad thing?PeteOlcott wrote: ↑Sat Apr 29, 2023 11:26 pmI vehemently disagree. As it stands now very effective propaganda could unite 70% of theImpenitent wrote: ↑Sat Apr 29, 2023 10:59 pm as long as people want something for nothing, humanity may soon perish...
computations are luxuries
-Imp
population of a country in using nuclear weapons to right a misconstrued wrong.
This could cause nuclear Winter that starves 99% of the population to death and murders
the remaining 1% by some of the 99% just trying to get some food.
As long as True(L,x) remains uncomputable humanity may soon perish
Re: As long as True(L,x) remains uncomputable humanity may soon perish
-
- Posts: 1557
- Joined: Mon Jul 25, 2016 6:55 pm
Re: As long as True(L,x) remains uncomputable humanity may soon perish
That seems to be asking can you run a computer program that no one ever wrote and thus does not yet exist?Eodnhoj7 wrote: ↑Wed May 17, 2023 11:54 pmCan you compute objectivity without first defining it through uncomputable means? Can computation result in a dictionary? Can you compute choice when all other variables are equal?PeteOlcott wrote: ↑Sat Apr 29, 2023 10:25 pm Unless and until we make True(L, x) computable so that there is an objective way
to discern dangerous lies from Truth humanity remains at great an increasing risk.
This is the reason why we need to refute Tarski Undefinability and its analogs
(isomorphisms) such as Gödel's 1931 Incompleteness Theorem.
-
- Posts: 1557
- Joined: Mon Jul 25, 2016 6:55 pm
Re: As long as True(L,x) remains uncomputable humanity may soon perish
We must have a set of axioms to give meaning to otherwise purely meaningless finite strings.Eodnhoj7 wrote: ↑Wed May 17, 2023 11:55 pmCan you compute, without unjustified axioms, why that is a bad thing?PeteOlcott wrote: ↑Sat Apr 29, 2023 11:26 pmI vehemently disagree. As it stands now very effective propaganda could unite 70% of theImpenitent wrote: ↑Sat Apr 29, 2023 10:59 pm as long as people want something for nothing, humanity may soon perish...
computations are luxuries
-Imp
population of a country in using nuclear weapons to right a misconstrued wrong.
This could cause nuclear Winter that starves 99% of the population to death and murders
the remaining 1% by some of the 99% just trying to get some food.
{cats are animals} is an axiom of English. We can encode the sum total of human knowledge
in these axioms and their relations to other axioms. To work correctly thus enabling a
consistently correct Truth predicate to be defined it must work the same way as Prolog.
True means has been proved in the system, false means the negation has been proved
in the system.
The Liar Paradox and every expression having pathological self-reference is rejected
by the system as not a truth bearer.
- Agent Smith
- Posts: 1442
- Joined: Fri Aug 12, 2022 12:23 pm
Re: As long as True(L,x) remains uncomputable humanity may soon perish
May be, PeteOlcott, if you could tell us what exactly it is that you're selling, some of us might just buy it! As far as I'm concerned your merchandise looks pretty cool. I'd happily give you a 4-star on the product review because Daisy, me dog, says "interesting scent" (bark, wag tail vigorously).
-
- Posts: 1557
- Joined: Mon Jul 25, 2016 6:55 pm
Re: As long as True(L,x) remains uncomputable humanity may soon perish
A notion of analytical truth that is simply just the way that analytical truth really works that TarskiAgent Smith wrote: ↑Thu May 18, 2023 3:22 am May be, PeteOlcott, if you could tell us what exactly it is that you're selling, some of us might just buy it! As far as I'm concerned your merchandise looks pretty cool. I'd happily give you a 4-star on the product review because Daisy, me dog, says "interesting scent" (bark, wag tail vigorously).
and Gödel were totally confused about. The sound deductive inference model is the end-all be-all
of analytical truth. If an expression of language is neither stipulated to be true nor deduced from
expressions that are stipulated to be true then the expression is simply not true.
This is the way that Prolog works.
This simple notion of truth is the way that analytical truth really words and it eliminates both Tarski
undefinability and Gödel incompleteness.
- Agent Smith
- Posts: 1442
- Joined: Fri Aug 12, 2022 12:23 pm
Re: As long as True(L,x) remains uncomputable humanity may soon perish
Superb! I can picture you with one hand around Gödel's scrawny neck and the other one around Tarski's. I'm super-excited about where you're going with this, despite the annoying fact that I won't be able to grok the formal version of yer argument.PeteOlcott wrote: ↑Thu May 18, 2023 4:54 amA notion of analytical truth that is simply just the way that analytical truth really works that TarskiAgent Smith wrote: ↑Thu May 18, 2023 3:22 am May be, PeteOlcott, if you could tell us what exactly it is that you're selling, some of us might just buy it! As far as I'm concerned your merchandise looks pretty cool. I'd happily give you a 4-star on the product review because Daisy, me dog, says "interesting scent" (bark, wag tail vigorously).
and Gödel were totally confused about. The sound deductive inference model is the end-all be-all
of analytical truth. If an expression of language is neither stipulated to be true nor deduced from
expressions that are stipulated to be true then the expression is simply not true.
This is the way that Prolog works.
This simple notion of truth is the way that analytical truth really words and it eliminates both Tarski
undefinability and Gödel incompleteness.
Math and Philosophia are intimately linked it seems and so much the better for it, oui? Just so you know, I don't like to contradict Gödel and his kind. It feels wrong somehow.
Re: As long as True(L,x) remains uncomputable humanity may soon perish
Olcott, you are a fucking idiot. And a liar.PeteOlcott wrote: ↑Thu May 18, 2023 4:54 amA notion of analytical truth that is simply just the way that analytical truth really works that TarskiAgent Smith wrote: ↑Thu May 18, 2023 3:22 am May be, PeteOlcott, if you could tell us what exactly it is that you're selling, some of us might just buy it! As far as I'm concerned your merchandise looks pretty cool. I'd happily give you a 4-star on the product review because Daisy, me dog, says "interesting scent" (bark, wag tail vigorously).
and Gödel were totally confused about. The sound deductive inference model is the end-all be-all
of analytical truth. If an expression of language is neither stipulated to be true nor deduced from
expressions that are stipulated to be true then the expression is simply not true.
This is the way that Prolog works.
Prolog is Turing-complete. Therefore there are Prolog expressions which do not terminate e.g there are Prolog expressions which are neither true nor false in Prolog itself.
Indeed such expressions are NOT true. But they are NOT false either!
Which is the whole damn point of undecidability!
- Agent Smith
- Posts: 1442
- Joined: Fri Aug 12, 2022 12:23 pm
Re: As long as True(L,x) remains uncomputable humanity may soon perish
Skepdick wrote: ↑Thu May 18, 2023 8:13 amOlcott, you are a fucking idiot. And a liar.PeteOlcott wrote: ↑Thu May 18, 2023 4:54 amA notion of analytical truth that is simply just the way that analytical truth really works that TarskiAgent Smith wrote: ↑Thu May 18, 2023 3:22 am May be, PeteOlcott, if you could tell us what exactly it is that you're selling, some of us might just buy it! As far as I'm concerned your merchandise looks pretty cool. I'd happily give you a 4-star on the product review because Daisy, me dog, says "interesting scent" (bark, wag tail vigorously).
and Gödel were totally confused about. The sound deductive inference model is the end-all be-all
of analytical truth. If an expression of language is neither stipulated to be true nor deduced from
expressions that are stipulated to be true then the expression is simply not true.
This is the way that Prolog works.
I think PeteOlcott has something else in mind mon ami. Me not sure though. Let's see where he takes us.
-
- Posts: 1557
- Joined: Mon Jul 25, 2016 6:55 pm
Re: As long as True(L,x) remains uncomputable humanity may soon perish
All of logic would be anchored in sound deductive inference.Agent Smith wrote: ↑Thu May 18, 2023 7:40 amSuperb! I can picture you with one hand around Gödel's scrawny neck and the other one around Tarski's. I'm super-excited about where you're going with this, despite the annoying fact that I won't be able to grok the formal version of yer argument.PeteOlcott wrote: ↑Thu May 18, 2023 4:54 amA notion of analytical truth that is simply just the way that analytical truth really works that TarskiAgent Smith wrote: ↑Thu May 18, 2023 3:22 am May be, PeteOlcott, if you could tell us what exactly it is that you're selling, some of us might just buy it! As far as I'm concerned your merchandise looks pretty cool. I'd happily give you a 4-star on the product review because Daisy, me dog, says "interesting scent" (bark, wag tail vigorously).
and Gödel were totally confused about. The sound deductive inference model is the end-all be-all
of analytical truth. If an expression of language is neither stipulated to be true nor deduced from
expressions that are stipulated to be true then the expression is simply not true.
This is the way that Prolog works.
This simple notion of truth is the way that analytical truth really words and it eliminates both Tarski
undefinability and Gödel incompleteness.
Math and Philosophia are intimately linked it seems and so much the better for it, oui? Just so you know, I don't like to contradict Gödel and his kind. It feels wrong somehow.
Any expression that is unprovable from true premises simply become untrue,
thus the Liar Paradox is rejected and the principle of explosion ceases to exist.
We could stipulate that the Golbach conjecture has an unknown truth value.
- Agent Smith
- Posts: 1442
- Joined: Fri Aug 12, 2022 12:23 pm
Re: As long as True(L,x) remains uncomputable humanity may soon perish
Please download me here!PeteOlcott wrote: ↑Thu May 18, 2023 2:34 pmAll of logic would be anchored in sound deductive inference.Agent Smith wrote: ↑Thu May 18, 2023 7:40 amSuperb! I can picture you with one hand around Gödel's scrawny neck and the other one around Tarski's. I'm super-excited about where you're going with this, despite the annoying fact that I won't be able to grok the formal version of yer argument.PeteOlcott wrote: ↑Thu May 18, 2023 4:54 am
A notion of analytical truth that is simply just the way that analytical truth really works that Tarski
and Gödel were totally confused about. The sound deductive inference model is the end-all be-all
of analytical truth. If an expression of language is neither stipulated to be true nor deduced from
expressions that are stipulated to be true then the expression is simply not true.
This is the way that Prolog works.
This simple notion of truth is the way that analytical truth really words and it eliminates both Tarski
undefinability and Gödel incompleteness.
Math and Philosophia are intimately linked it seems and so much the better for it, oui? Just so you know, I don't like to contradict Gödel and his kind. It feels wrong somehow.
Any expression that is unprovable from true premises simply become untrue,
thus the Liar Paradox is rejected and the principle of explosion ceases to exist.
We could stipulate that the Golbach conjecture has an unknown truth value.
-
- Posts: 1557
- Joined: Mon Jul 25, 2016 6:55 pm
Re: As long as True(L,x) remains uncomputable humanity may soon perish
One of my reviewers is a mindless naysayer.Agent Smith wrote: ↑Thu May 18, 2023 9:18 amSkepdick wrote: ↑Thu May 18, 2023 8:13 amOlcott, you are a fucking idiot. And a liar.PeteOlcott wrote: ↑Thu May 18, 2023 4:54 am
A notion of analytical truth that is simply just the way that analytical truth really works that Tarski
and Gödel were totally confused about. The sound deductive inference model is the end-all be-all
of analytical truth. If an expression of language is neither stipulated to be true nor deduced from
expressions that are stipulated to be true then the expression is simply not true.
This is the way that Prolog works.
I think PeteOlcott has something else in mind mon ami. Me not sure though. Let's see where he takes us.
- Agent Smith
- Posts: 1442
- Joined: Fri Aug 12, 2022 12:23 pm
Re: As long as True(L,x) remains uncomputable humanity may soon perish
No comment! Above me pay grade mon ami.PeteOlcott wrote: ↑Thu May 18, 2023 2:51 pmOne of my reviewers is a mindless naysayer.Agent Smith wrote: ↑Thu May 18, 2023 9:18 am
I think PeteOlcott has something else in mind mon ami. Me not sure though. Let's see where he takes us.
-
- Posts: 1557
- Joined: Mon Jul 25, 2016 6:55 pm
Re: As long as True(L,x) remains uncomputable humanity may soon perish
It is an objectively verified fact that when sound deductive inference becomes the foundation ofAgent Smith wrote: ↑Thu May 18, 2023 2:56 pmNo comment! Above me pay grade mon ami.PeteOlcott wrote: ↑Thu May 18, 2023 2:51 pmOne of my reviewers is a mindless naysayer.Agent Smith wrote: ↑Thu May 18, 2023 9:18 am
I think PeteOlcott has something else in mind mon ami. Me not sure though. Let's see where he takes us.
the notion of analytical truth that Tarski Undefinability, Gödel incompleteness and the principle
of explosion cannot possibly exist. Some people that cannot comprehend that denigrate it out of
their own ignorance.
One short coming of this system is that it only works on the subset of truth known as knowledge.
It would conclude that the Goldbach conjecture is not true on the basis that is no finite sequence
of deductive steps to show that it is true.
As such a system grows in its intelligence (like ChatGPT) it will be able to figure out on its own
that the Goldbach conjecture has an unknown truth value. When it becomes 10,000-fold more
intelligent than humans it may be able to answer the Goldbach conjecture by finding a finite
sequence of deductive steps.
- Agent Smith
- Posts: 1442
- Joined: Fri Aug 12, 2022 12:23 pm
Re: As long as True(L,x) remains uncomputable humanity may soon perish
My bafflement can be related simply as what happened to the other guy? He seems to have given us the slip!! Where could he have gone?!PeteOlcott wrote: ↑Thu May 18, 2023 3:56 pmIt is an objectively verified fact that when sound deductive inference becomes the foundation of
the notion of analytical truth that Tarski Undefinability, Gödel incompleteness and the principle
of explosion cannot possibly exist. Some people that cannot comprehend that denigrate it out of
their own ignorance.
One short coming of this system is that it only works on the subset of truth known as knowledge.
It would conclude that the Goldbach conjecture is not true on the basis that is no finite sequence
of deductive steps to show that it is true.
As such a system grows in its intelligence (like ChatGPT) it will be able to figure out on its own
that the Goldbach conjecture has an unknown truth value. When it becomes 10,000-fold more
intelligent than humans it may be able to answer the Goldbach conjecture by finding a finite
sequence of deductive steps.
I suggest you explore the territory using a grid so that you don't, you know, miss a spot.
Re: As long as True(L,x) remains uncomputable humanity may soon perish
And you would require a potential computer program beyond that one, and beyond that one....so on to infinity. This never ending potential always requires the program as being dependent on something which is not a program until the new program emerges.PeteOlcott wrote: ↑Thu May 18, 2023 3:06 amThat seems to be asking can you run a computer program that no one ever wrote and thus does not yet exist?Eodnhoj7 wrote: ↑Wed May 17, 2023 11:54 pmCan you compute objectivity without first defining it through uncomputable means? Can computation result in a dictionary? Can you compute choice when all other variables are equal?PeteOlcott wrote: ↑Sat Apr 29, 2023 10:25 pm Unless and until we make True(L, x) computable so that there is an objective way
to discern dangerous lies from Truth humanity remains at great an increasing risk.
This is the reason why we need to refute Tarski Undefinability and its analogs
(isomorphisms) such as Gödel's 1931 Incompleteness Theorem.