Are you going to invent this language from scratch, or are you going to extend English to meet your needs?
Why doesn't English meet your needs presently?
Search found 9165 matches
- Sun May 22, 2022 8:44 pm
- Forum: Philosophy of Language
- Topic: solving language
- Replies: 28
- Views: 3570
- Sun May 22, 2022 8:30 pm
- Forum: Logic and Philosophy of Mathematics
- Topic: Proof that H(P,P)==0 is correct [ refuting the halting problem proofs ]
- Replies: 92
- Views: 1543
Re: Proof that H(P,P)==0 is correct [ refuting the halting problem proofs ]
Any sufficiently technically competent person can easily reverse-engineer the correct x86 emulation of this source-code by H(P,P) without knowing anything else besides this source-code and that H emulates its input with an x86 emulator. That you cannot do this conclusively proves that you are not a...
- Sun May 22, 2022 8:14 pm
- Forum: Logic and Philosophy of Mathematics
- Topic: Proof that H(P,P)==0 is correct [ refuting the halting problem proofs ]
- Replies: 92
- Views: 1543
Re: Proof that H(P,P)==0 is correct [ refuting the halting problem proofs ]
Ah so you simply "do not believe in" x86 assembly language. Strawman. Assembly is source code. C is source code. Show me a complete memory dump of your system. Starting at address 000011a2 Give me all the details so that I can reproduce the experiment on my own hardware (in case you are lying to us).
- Sun May 22, 2022 7:54 pm
- Forum: Logic and Philosophy of Mathematics
- Topic: Proof that H(P,P)==0 is correct [ refuting the halting problem proofs ]
- Replies: 92
- Views: 1543
Re: Proof that H(P,P)==0 is correct [ refuting the halting problem proofs ]
I only glanced at your words for a half second to realize that you are still denying the dead obvious verified facts. That only speaks to your inability to process feedback and correct your work. There are no facts in your work - only bullshit. I am denying the validity of your methodology and dism...
- Sun May 22, 2022 7:25 pm
- Forum: Logic and Philosophy of Mathematics
- Topic: Proof that H(P,P)==0 is correct [ refuting the halting problem proofs ]
- Replies: 92
- Views: 1543
Re: Proof that H(P,P)==0 is correct [ refuting the halting problem proofs ]
By reverse engineering what the behavior of the input to H(P,P) would be if we assume that H performs a pure x86 emulation of its input for the first emulation and the first nested emulation. The x86 source-code of P specifies everything that we need to know to do this. _P() [00001352](01) 55 push ...
- Fri May 20, 2022 10:29 am
- Forum: Logic and Philosophy of Mathematics
- Topic: Problems with Equivocation II
- Replies: 6
- Views: 195
Re: Problems with Equivocation II
-1^2=55/55 https://i.postimg.cc/Wb2j0y3N/face-with-tears-of-joy-1f602.png Hey! Is this you? truth is always relative to a particular model. it's a property that varies depending on the model of the axioms. There are simply different models of number systems in which statements that are true in one ...
- Fri May 20, 2022 12:05 am
- Forum: Logic and Philosophy of Mathematics
- Topic: Proof that H(P,P)==0 is correct [ refuting the halting problem proofs ]
- Replies: 92
- Views: 1543
Re: Proof that H(P,P)==0 is correct [ refuting the halting problem proofs ]
It doesn't take any of these things for a C function to analyze the x86 machine language trace of another C function. Pete, you are a fucking bullshitter. How have you obtained the "x86 execution trace" of a C program which doesn't compile to an x86 executable? #include <stdint.h> #define u32 uint3...
- Thu May 19, 2022 5:19 pm
- Forum: Logic and Philosophy of Mathematics
- Topic: Problems with Equivocation II
- Replies: 6
- Views: 195
Re: Problems with Equivocation II
A=A equivocates to an infinite variety of things therefore is subject to equivocation. This infinite variety of things can be expressed as: 1. (A=A), (B=B), (C=C),... 2. (A=B), (A=C), (A=D),... (where B,C,D... are variations of A.) Congratulations. You have re-invented types/propositions. Everythin...
- Thu May 19, 2022 4:37 pm
- Forum: Ethical Theory
- Topic: Prepositions, Facts, States of Affairs - all Groundless
- Replies: 19
- Views: 317
Re: PrOpositions, Facts, States of Affairs - all Groundless
mutually exclusive fact claims can be simultaneously true if you are just willing to make that the entire point of your new logic and forget everythiong else. What a colourful wordsalad that was. Which part of "no privileged descriptions" is going over your head exactly? There is no such thing as "...
- Thu May 19, 2022 7:49 am
- Forum: Logic and Philosophy of Mathematics
- Topic: Proof that H(P,P)==0 is correct [ refuting the halting problem proofs ]
- Replies: 92
- Views: 1543
Re: Proof that H(P,P)==0 is correct [ refuting the halting problem proofs ]
It does not have to be source-code. In only has to specify the actual behavior of the actual input. 👆👆👆 This right here is why you don't understand the issue. You can't specify the "actual behavior" of a self-modifying program at compile-time , because a self-modifying program changes its own "actu...
- Wed May 18, 2022 3:38 pm
- Forum: Logic and Philosophy of Mathematics
- Topic: Proof that H(P,P)==0 is correct [ refuting the halting problem proofs ]
- Replies: 92
- Views: 1543
Re: Proof that H(P,P)==0 is correct [ refuting the halting problem proofs ]
You prove that you don't have a clue in this post: Pure functions? What the heck are those ?!?! Q.E.D Your decider keeps being wrong. Every. Damn. Time. If you decide to stop being an idiot maybe you'll spot the difference between applying the function "max" to parameters "1 2 3 4 5" - which return...
- Wed May 18, 2022 10:28 am
- Forum: Logic and Philosophy of Mathematics
- Topic: Proof that H(P,P)==0 is correct [ refuting the halting problem proofs ]
- Replies: 92
- Views: 1543
Re: Proof that H(P,P)==0 is correct [ refuting the halting problem proofs ]
I give up. You are incompetent on this subject. Your competence decider is as broken as your halting decider. You are still oblivious to the fact that the definition of P (in the form of plain-text source code) is not being passed as an input to H! Learn about quoting, and self-evaluating forms dum...
- Tue May 17, 2022 8:29 pm
- Forum: Logic and Philosophy of Mathematics
- Topic: Proof that H(P,P)==0 is correct [ refuting the halting problem proofs ]
- Replies: 92
- Views: 1543
Re: Proof that H(P,P)==0 is correct [ refuting the halting problem proofs ]
It need not be text. Definition of "source code". a text listing of commands to be compiled or assembled into an executable computer program. Another definition a computer program written in text form that must be translated into another form, such as machine code, before it can run on a computer W...
- Tue May 17, 2022 6:19 pm
- Forum: Logic and Philosophy of Mathematics
- Topic: Proof that H(P,P)==0 is correct [ refuting the halting problem proofs ]
- Replies: 92
- Views: 1543
Re: Proof that H(P,P)==0 is correct [ refuting the halting problem proofs ]
You simply do not have enough sufficiently relevant technical background to correctly review my work. This work has already been very extensively reviewed with thousands of reviews and none of the reviews brought up the issue that you raised about source-code versus x86 machine language. Pete. Your...
- Tue May 17, 2022 6:01 pm
- Forum: Logic and Philosophy of Mathematics
- Topic: Proof that H(P,P)==0 is correct [ refuting the halting problem proofs ]
- Replies: 92
- Views: 1543
Re: Proof that H(P,P)==0 is correct [ refuting the halting problem proofs ]
It does not have to be source-code. In only has to specify the actual behavior of the actual input. Can you fucking read? For any program H that might determine if programs halt, a "pathological" program P, called with some input, can pass its own source and its input to H and then specifically do ...