Author Topic: 68k 64-bit multiplication  (Read 13256 times)

0 Members and 1 Guest are viewing this topic.

AngelFish

• Is this my custom title?
• LV12 Extreme Poster (Next: 5000)
• Posts: 3242
• Rating: +270/-27
• I'm a Fishbot
Re: 68k 64-bit multiplication
« Reply #15 on: August 07, 2011, 09:13:12 pm »
Base 0 isn't defined, but base 1 is by 0↦0↺ ∀ {ai+ 110∈ ℝ}
« Last Edit: August 07, 2011, 09:19:18 pm by Qwerty.55 »
∂²Ψ    -(2m(V(x)-E)Ψ
---  = -------------
∂x²        ℏ²Ψ

christop

• LV3 Member (Next: 100)
• Posts: 87
• Rating: +20/-0
Re: 68k 64-bit multiplication
« Reply #16 on: August 07, 2011, 10:09:55 pm »
With a calculator handy

The basic fact you end up using is that any number x can be represented in base z as ∑aizi
With the exception of when z = 0 or |z|=1, of course
Awww, no nullary number system?

With base 1, do you use as many digits as will add up to the value? For example, is 7 decimal equal to 1111111 unary? I also don't see how fractions can be represented in unary.
Christopher Williams

AngelFish

• Is this my custom title?
• LV12 Extreme Poster (Next: 5000)
• Posts: 3242
• Rating: +270/-27
• I'm a Fishbot
Re: 68k 64-bit multiplication
« Reply #17 on: August 07, 2011, 10:15:04 pm »
Unary is one type of Base 1 system. However, there are other types involving symbol collision which are currently in dispute on IRC
∂²Ψ    -(2m(V(x)-E)Ψ
---  = -------------
∂x²        ℏ²Ψ