flat assembler
Message board for the users of flat assembler.

 Index > Heap > Do powerful Binary Logic EASY in your Head, Version 7.0
Author
mbr_tsr

Joined: 03 Apr 2011
Posts: 4903
mbr_tsr
===================================================
Mental Math Using Binary by Shawn T. Cook
A College DropOuts Report (Version 7.0)
===================================================
We think in binary, when we write the numbers 0, 1,
2, and 3 in binary, they become two digits, giving
is extra precision and control of the numbers. Binary
is a base 2 number system, with only 0 and 1 or off
and on. When we compare two binary numbers we can
apply logic to produce another number as the answer.
For example James is 1 happy and Joan is 0 and when
we compare 1 with 0 we can produce a result, that
if James is 1 and Joan is 0 then not both of them
are happy, or James has the advantage. You can
tell a lot by comparing zeros and ones, such as
that are unique, or older, and when we apply the
logic, we can cancel or swap the zeros and ones
when we compare them to produce the answer.
===================================================
How to Count to 3 (2 bits) in Binary:
00 = 0 (off, off)
01 = 1 (off, on)
10 = 2 (on, off)
11 = 3 (on, on)
===================================================
bit as 0 = off any y, no, false, argue, old, loss
bit as 1 = on any y, yes, true, agree, new, gain
===================================================
0=none 1=low 2=medium 3=high
0=before 1=start 2=during 3=finish
0=0% 1=1% 2=50% 3=100%
===================================================
There are 16 logic instructions between bTeacher and

bTeacher = On while bStudent = On = x1
bTeacher = On while bStudent = Off = x2
bTeacher = Off while bStudent = On = x3
bTeacher = Off while bStudent = Off = x4

We get 16 different possibilities because 2*2*2*2=16
instructions. So when you change the 1 bit x1, x2, x3,
x4 values you create the 16 instructions. Each of the
16 operations is of equal significance.
===================================================
Zap## = x1,x2,x3, and x4 values.
bAnswer is Teachers bits Compared with Students.
===================================================
So we take bTeacher and compare it's bits with bStudent to
produce bAnswer. So we can do 0 to 3 in binary, byte 1 is
bTeacher (2 bits) and byte 2 is bStudent (2 bits) to produce
byte bAnswer (2 bits) So we can compare the 2bits in bStudent
with the 2bits in bTeacher using one of the 16 logic
===================================================
Here are the 16 logic operations and their meaning:
Zap00 x1=0 x2=0 x3=0 x4=0 = nul, ignore
Zap01 x1=0 x2=0 x3=0 x4=1 = nor, unknown, hide
Zap02 x1=0 x2=0 x3=1 x4=0 = learn, idea
Zap03 x1=0 x2=0 x3=1 x4=1 = request, need
Zap04 x1=0 x2=1 x3=0 x4=0 = invade, seep
Zap05 x1=0 x2=1 x3=0 x4=1 = not, opposite, wash
Zap06 x1=0 x2=1 x3=1 x4=0 = xor, unique
Zap07 x1=0 x2=1 x3=1 x4=1 = nand, dispute
Zap08 x1=1 x2=0 x3=0 x4=0 = and, strength
Zap09 x1=1 x2=0 x3=0 x4=1 = fully agree
Zap10 x1=1 x2=0 x3=1 x4=0 = boost, take prize, stoop
Zap11 x1=1 x2=0 x3=1 x4=1 = betray, fail
Zap12 x1=1 x2=1 x3=0 x4=0 = can, able, but
Zap13 x1=1 x2=1 x3=0 x4=1 = deaf, error, focus
Zap14 x1=1 x2=1 x3=1 x4=0 = or, done, ready
Zap15 x1=1 x2=1 x3=1 x4=1 = max, listen, win
===================================================
Some examples so you can get the knack:

Lets take Zap04 for example, and suggest x2 means only
1 right and 0 wrong equals right. So in binary, 11 right
and 10 wrong = 01 right, or written in decimal, 3 right
and 2 wrong makes only 1 right. Or another setup, bits
as 01 right and 11 wrong means 00 right.

Lets assume only bit 1 on compared with bit 0 off equals
1 on, this means were using Zap04, so the healer is 3
and the wound is 2, in binary it is 11=3 and 10=2 so
the answer is we need 01 healing, or the effective
efficient amount of healing we need is 1.

3 Zap01 3 = 0
(11 Zap01 11 = 00) bTeacher=3 bStudent=3 bAnswer=0
(Best way for teacher to hide from student, mystery.)

2 Zap02 3 = 1
(10 Zap02 11 = 01) bTeacher=2 bStudent=3 bAnswer=1
(Teacher knows 2 student knows 3 so teacher learns 1.)

1 Zap03 3 = 2
(01 Zap03 11 = 10) bTeacher=1 bStudent=3 bAnswer=2
(Teacher has 1 iota student has 3 so teacher needs 2.)

3 Zap03 1 = 0
(11 Zap03 01 = 00) bTeacher=1 bStudent=3 bAnswer=2
(Teacher has 3 iotas student has 1 so teacher needs 0.)

3 Zap08 1 = 1
(11 Zap08 01 = 01) bTeacher=3 bStudent=1 bAnswer=1
(Teacher is 3 talented, student is 1, shared talent is 1.)

3 Zap10 1 = 1
(11 Zap10 01 = 01) bTeacher=3 bStudent=1 bAnswer=1
(Teacher has 3 student has 1 so teacher takes prize of 1.)

0 Zap12 3 = 0
(00 Zap12 11 = 00) bTeacher=0 bStudent=3 bAnswer=0
(Teacher can 0 student can 3 so teacher is 0 able.)
===================================================
With this formula we can nand, nor, and, not, xor, or, but,
will, should, and any binary logic IN YOUR MIND. We can
compare the teachers stuff with the students, and toggle
bits on or off in the answer, based on logic, good, bad,
harm, love, fair, love, mood, spirit and talents, so
===================================================

Last edited by mbr_tsr on 08 Jul 2013, 01:42; edited 3 times in total
21 Jun 2013, 22:17
matefkr

Joined: 02 Sep 2007
Posts: 1291
Location: Ukraine, Beregovo
matefkr
later i read it and will try to interpret.
22 Jun 2013, 00:18
matefkr

Joined: 02 Sep 2007
Posts: 1291
Location: Ukraine, Beregovo
matefkr
i just redescovered an awefully good video game (well to an extent) with a pretty neat engine (at least compared to some). i was not interneting much today. tomorrow some radio making and some learning perhaps.. and perhaps some game modding (perhapsperhaps). Cleaning puss (if any) out of cats vagina (well veterinary things here not the best at all).
22 Jun 2013, 21:47
typedef

Joined: 25 Jul 2010
Posts: 2913
Location: 0x77760000
typedef
You two are a match made in heaven...
22 Jun 2013, 22:21
sleepsleep

Joined: 05 Oct 2006
Posts: 8885
Location: ˛　　　　　　　　　　　　　　　　　　　　　　　　　　　　　⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣Posts: 334455
sleepsleep
Shawn T. Cook
the love shack os

beautiful,
22 Jun 2013, 23:06
typedef

Joined: 25 Jul 2010
Posts: 2913
Location: 0x77760000
typedef
23 Jun 2013, 01:46
matefkr

Joined: 02 Sep 2007
Posts: 1291
Location: Ukraine, Beregovo
matefkr
Typedef: i don believe in already existing heaven ( as happiness for infinity within spatial constraints according to the absolute coordinate system).
I think it is yet to be made, but perhaps it already exists.
23 Jun 2013, 11:20
sleepsleep

Joined: 05 Oct 2006
Posts: 8885
Location: ˛　　　　　　　　　　　　　　　　　　　　　　　　　　　　　⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣Posts: 334455
sleepsleep
23 Jun 2013, 15:36
typedef

Joined: 25 Jul 2010
Posts: 2913
Location: 0x77760000
typedef
sleepsleep wrote:
typedef wrote:

http://www.members.tripod.com/cpu_bios/

I don't wanna be up there digging when he can just handle me the source code. If he wishes to do so that it.
24 Jun 2013, 02:03
mbr_tsr

Joined: 03 Apr 2011
Posts: 4903
mbr_tsr
Photo of me *after* making the Zap Instructions during a lightning Storm.... www.gorf32.webs.com/shawn.jpg
24 Jun 2013, 08:45
matefkr

Joined: 02 Sep 2007
Posts: 1291
Location: Ukraine, Beregovo
matefkr
interesting.
24 Jun 2013, 20:38
sleepsleep

Joined: 05 Oct 2006
Posts: 8885
Location: ˛　　　　　　　　　　　　　　　　　　　　　　　　　　　　　⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣Posts: 334455
sleepsleep
mbr_tsr wrote:
Photo of me *after* making the Zap Instructions during a lightning Storm.... www.gorf32.webs.com/shawn.jpg

good looking
25 Jun 2013, 15:35
mbr_tsr

Joined: 03 Apr 2011
Posts: 4903
mbr_tsr
The greatest binary logic mysteries SOLVED, a very easy way to do EVERY logical calculation in binary EASY, in your head, before i wrote this tutorial, i NEVER realized there were only 16 possible logic operations between teacher and student, and we can peek and poke bits, compare them, and format potent valuable answers, WE THING in binary, that is Amazing, and learn dark secrets to the meaning of binary logic, throw all your microchips in the trash, because you only need 4 bits, EASY to do in your head, and this robust knowledge will always be there, a lesson that lasts forever, when you drift off to sleep and dream, TransImagine what your calculating, a GodSend, read the tutorial here to get you out of trouble and debt anytime and anywhere here ---> (on my web site)
27 Jun 2013, 00:52
matefkr

Joined: 02 Sep 2007
Posts: 1291
Location: Ukraine, Beregovo
matefkr
dont solve binary logic. it is regarding thinking gives too much power for the evil. on the other hand, please shape your moustash, and hair, so it ressembles Adolf Hitler.
27 Jun 2013, 15:08
mbr_tsr

Joined: 03 Apr 2011
Posts: 4903
mbr_tsr
i have a little tip in binary one thousand is 8 and one hundred is 4 and ten is 3 and one is 1 so to count to 15 in binary means one thousand one hundred and eleven, or to count to 5 is one hundred and one. example 1000 binary is one thousand or 8
08 Jul 2013, 01:41
 Display posts from previous: All Posts1 Day7 Days2 Weeks1 Month3 Months6 Months1 Year Oldest FirstNewest First

 Jump to: Select a forum Official----------------AssemblyPeripheria General----------------MainDOSWindowsLinuxUnixMenuetOS Specific----------------MacroinstructionsCompiler InternalsIDE DevelopmentOS ConstructionNon-x86 architecturesHigh Level LanguagesProgramming Language DesignProjects and IdeasExamples and Tutorials Other----------------FeedbackHeapTest Area

Forum Rules:
 You cannot post new topics in this forumYou cannot reply to topics in this forumYou cannot edit your posts in this forumYou cannot delete your posts in this forumYou cannot vote in polls in this forumYou can attach files in this forumYou can download files in this forum