BF2S Forums Claim anything, I'll prove it wrong

NooBesT[FiN] wrote:

devilhammer wrote:

NooBesT[FiN] wrote:

JAyThaRevo wrote:

A Computer works with 1's and 0's.

Computer works with electricity.


But you still thought about what username you would choose.

Actually I never have, I use this one because my friend made it.

Oh c'mon.

It's not about your username. That post that I'm referring to is your thoughts. You thought up what to type, typed it and then sent it here.

I did not think about what to type I thought about where to press my fingers down to create a letter on the screen which in turn made a sentence.

devilhammer wrote:

NooBesT[FiN] wrote:

devilhammer wrote:

Actually I never have, I use this one because my friend made it.

Oh c'mon.

It's not about your username. That post that I'm referring to is your thoughts. You thought up what to type, typed it and then sent it here.

I did not think about what to type I thought about where to press my fingers down to create a letter on the screen which in turn made a sentence.

...


If you aren't thinking about anything then you can't make statements and therefore your posts don't exist and there's nothing for me to prove wrong.

killer21 wrote:

1 + 1=10

1 + 1 = 2

killer21 wrote:

'NooBesT[FiN wrote:

killer21 wrote:

1 + 1=10

1 + 1 = 2

Wrong chief.  In binary, if you add 1 +1 you get 0 but carry a 1 so it really equals 10. /win.

In binary it's actually 11... Besides, you never stated it is in binary.

Last edited by NooBesT[FiN] (2007-05-19 18:45:53)

NooBesT[FiN] wrote:

In binary it's actually 11... Besides, you never stated it is in binary.

Addition
The circuit diagram for a binary half adder, which adds two bits together, producing sum and carry bits.
The circuit diagram for a binary half adder, which adds two bits together, producing sum and carry bits.

The simplest arithmetic operation in binary is addition. Adding two single-digit binary numbers is relatively simple:

    0 + 0 = 0
    0 + 1 = 1
    1 + 0 = 1
    1 + 1 = 10 (carry:1)

Again, /win.

NooBesT[FiN] wrote:

devilhammer wrote:

NooBesT[FiN] wrote:

devilhammer wrote:

I did not think about what to type I thought about where to press my fingers down to create a letter on the screen which in turn made a sentence.

...


If you aren't thinking about anything then you can't make statements and therefore your posts don't exist and there's nothing for me to prove wrong.


1 + 1 = 2

Then why keep trying to disprove my statements if they do not exist, according to your assumptions.....

To prove you wrong in every way possible.

killer21 wrote:

NooBesT[FiN] wrote:

In binary it's actually 11... Besides, you never stated it is in binary.

Addition
The circuit diagram for a binary half adder, which adds two bits together, producing sum and carry bits.
The circuit diagram for a binary half adder, which adds two bits together, producing sum and carry bits.

The simplest arithmetic operation in binary is addition. Adding two single-digit binary numbers is relatively simple:

    0 + 0 = 0
    0 + 1 = 1
    1 + 0 = 1
    1 + 1 = 10 (carry:1)

Again, /win.

Read the rules...

But have you proved me wrong yet?

devilhammer wrote:

NooBesT[FiN] wrote:

devilhammer wrote:

Then why keep trying to disprove my statements if they do not exist, according to your assumptions.....

To prove you wrong in every way possible.

killer21 wrote:

Addition
The circuit diagram for a binary half adder, which adds two bits together, producing sum and carry bits.
The circuit diagram for a binary half adder, which adds two bits together, producing sum and carry bits.

The simplest arithmetic operation in binary is addition. Adding two single-digit binary numbers is relatively simple:

    0 + 0 = 0
    0 + 1 = 1
    1 + 0 = 1
    1 + 1 = 10 (carry:1)

Again, /win.

Read the rules...

But have you proved me wrong yet?

Yes. Pretty many times actually.

killer21 wrote:

NooBesT[FiN] wrote:

Read the rules...

Ah.  So the proverbial, "I can't not be wrong" statement.  Cool.  I've got this one won.  Moving on.  No use in being in this thread anymore.  /win

Eh... I proved you wrong. The rules say that you may not change your statements, if you could this would be pretty pointless as everyone would just adapt their statements to our proves.

Then you changer your statement and say that you win... Logics FTW!

Last edited by NooBesT[FiN] (2007-05-19 18:58:07)

NooBesT[FiN] wrote:

Eh... I proved you wrong. The rules say that you may not change your statements, if you could this would be pretty pointless as everyone would just adapt their statements to our proves.

Then you changer your statement and say that you win... Logics FTW!

I didn't change my statement.  You just assumed I was talking about simple addition problem when in fact, I was referring to binary.  If you knew anything about binary, you would have automatically known the answer without me having to say anything about it being a binary statement. 

killer21 wrote:

De_Jappe wrote:

yours is only correct in base 2

In any other base (10 for example as most common) it is wrong. Ergo the statement that 1+1=10 is wrong as it only counts in one case and not in all.

I know that but the purpose of this thread is to have them prove me wrong, which he couldn't so.

Ahum, my statement proves you are wrong...

So: You claim something
I give you a situation in which your claim is wrong (base 10 for example which Noobest already said but oke)
thus your claim is wrong
Ergo We proved you wrong...

De_Jappe wrote:

yours is only correct in base 2

The statement is correct in base 2.  It doesn't matter if base 10 is the most commonly used base system used today.  That is totally irrelevant.  It seems this whole thread is a gigantic farce.  Sweet.  Moving on.

There are 10 types of people, those who understand binary, and those who don't.

To Killer21

You obviously have no idea how prove works:

Suppose you say: Chocolate is brown.

I show you white chocolate. This is a case where your statement is false. Ergo the statement: chocolate is brown is NOT true. The statement: brown chocolate exists is true however.

Your logic however says: I don't mind white chocolate exists, brown exists too, so I'm right if I say chocolate is brown. 

So either you had to claim: "1+1 = 10 in binary language"
Cause if you claim that 1+1 = 10, you claim it's always that way. I give you an example where it isn't so, so your claim is false.
The fact that it isn't true in base 10 is totally relevant and is the prove that your statement is not true. So it is proven wrong.

Last edited by De_Jappe (2007-05-19 19:17:14)

As far as humans know, matter can not be destroyed.