The load of the address would be one of your weird formulas ofcourse. Also thats PutS, not PutC

Okay, so i count 8 pairs of ->{x}^^r. That means you wrote 16 bytes, im guessing:
0xEF, 0x45, 0x0A, H, e, l, l, o, , w, o, r, l, d, 0x00
Also known as

    bcall(_PutS)
    ret
.db "Hello world", 0

You probable wrote them to saferam or something, which means after writing you probably call the address where you wrote your code.

The only thing i dont get is how you actually print the value, or does (x)() work on bcalls? Other than that you might be able to compress it with smc

I'm having vietnam flashbacks to that one javascript program that did the same.
Is that all on the same line btw?

Non euclidean, but yes

I don't know if you can at the moment, what with the 2048 bit rsa key and all. Not sure if that only applies to apps though.

On a sidenote, there exists an algoritm that can eliminate a lot of work when multiplying two big numbers. It has something to do with divide and conquer.

I made a nice raycaster a while back: https://github.com/QuantumInfinity/AntiCaster It needs some updating though, since i could optimize out a square root.
Also i should change to a better build system than eclipse project builder... IF i ever get around to it. Anyway maybe you could learn something from the source, though its probably quite complicated and
not very well commented (read: not at all).

Hang on, what happens if you don't post anything related to your posts number? (Also: you broke your own rules by posting more than twice this week )

Quote from: c4ooo on March 21, 2017, 10:51:29 PM

Quote from: Snektron on March 21, 2017, 08:08:29 PM
Nice! In what language are you writing this? And do you have an indication of the speed?
regarding trig, you can find various articles on the internet, mostly they're an approximation with exponents (If you want to derive them
yourself, you'll need to use taylor polynomals ).
For exponents you'll only need to impelemnt ln(x) and e^(x), since you can rewrite any log(x, y) and x^y to a form using ln and e^(x). Good luck

I don't have addition/division, but my guess is that it will be fine. Basically, it will always take longer for you to type the number then for the program to compute :3
Also, why would i need ln(x) if its just log(x)/log(e) ? As a start, i will only have base 10 log. BTW, how do i rewrite x^y as e^(x)

Because there is more information on how to implement ln(x)

To rewrite x^y as a power of e you would use the fact x = e^ln(x)
x^y = (e^ln(x))^y = e^(y*ln(x)).

Assembly isn't really that hard, but you have to think a bit different than you would with high level programming. If
you find a good tutorial is definitely learnable

Well it didn't take long for you guys to lose track of the count.
Also i am 10 because i have a 10 inch c

Nice! In what language are you writing this? And do you have an indication of the speed?
regarding trig, you can find various articles on the internet, mostly they're an approximation with exponents (If you want to derive them
yourself, you'll need to use taylor polynomals ).
For exponents you'll only need to impelemnt ln(x) and e^(x), since you can rewrite any log(x, y) and x^y to a form using ln and e^(x). Good luck

I thought konami was doomed since they stopped making that silent hill game.

Really cool! I wonder if someday there'll be a 3D plotter that uses this. It seems the perfect base.