Infinite Compression Explained

Because most of you don't read my blog,(i don't read random blogs as well) and have so much questions about what i'm doing with my programs, i'll write it here:
All of the programs(about 6 developed so far) despite wildly varying routines are targeted to generate large integers.
These integers are not files. Following transformations occurs:
encode
1.file is converted to large integer X(arbitrary length).
2.X multiplied by some scale factor e.g. 10e1000 to get a lower bound
2.(X+1)by some scale factor e.g. 10e1000 to get an uppper bound
3.a search is performed for finding numbers inside that range which are easy to represent via formula.
4.if number(s) found its saved to a file.
decode:
1.a formula is supplied with number(s) and filesize
2.the formula generates an integer/float, which is then divided by scale factor(e.g. 10e1000).
3.the first filesize bytes are then written to output.

the proces isn't perfected yet, because the formulas currently used in my programs either too slow to search or cuttoff at float precision(for non-integer parameters)
________________________________________________
http://xs135.xs.to/xs135/09042/av922.jpg
orbis terrarum delenda est

int powers

>>120
gay you just lost the game

>>38
(　≖‿≖)　　D
( ≖‿≖ ) 　　I
(≖‿≖　)　　C
(‿≖   ) 　　K
(≖　　　) 　　
(　 　　 ) 　　T
(　 　　 ) 　　O
(　　　≖) 　　W
( 　≖‿) 　　E
(　≖‿≖)　　R

>>121 int powers:
2^6 is int power of 2, 2^7.1 is float power of 2.
The range of results from floats is vastly larger then range of ints

_____________________________________
http://xs135.xs.to/xs135/09042/av922.jpg
orbis terrarum delenda est

>>124
floats
try rational exponents, haven't we gone over this?

>>125 Sorry there no such functions in GMP. Only Unsigned Long Ints can be exponents.


______________________________________
http://xs135.xs.to/xs135/09042/av922.jpg
orbis terrarum delenda est

Until GMP adds float^float i'll focus on other algorithms(So of them very promising though integer-only).

____________________________________________
http://xs135.xs.to/xs135/09042/av922.jpg
orbis terrarum delenda est

>>126
MATH IS SO AMAZING. YOU SHOULD LOOK IT UP SOME TIME.

>>38
You're an anus!

I'M HELPING HIM

e^(a * log b) = b ^ a

>>130 ^(a * log b) <--You fail right there. Its also float^float which isn't available in GMP.


_______________________________________________
http://xs135.xs.to/xs135/09042/av922.jpg
orbis terrarum delenda est

This thread has been closed and replaced with the following thread:

Subject: Compiling C++ code in a Scheme compiler
Name: Anonymous
Email:

It still doesn't work.

>>131
IT'S CALLED THE exp FUNCTION

>>133 I don't see any exp functions which allow e^float in GMP manual.
Please provide a link where its located.

______________________________
http://xs135.xs.to/xs135/09042/av922.jpg
orbis terrarum delenda est

>>132
Have you tried using eval?

>>135
I'm pretty sure that he'll enjoy being stuffed into anuses of clueless toddlers. (　≖‿≖)

>>132
Might I suggest adding more parentheses?

>>134
http://www.zvon.org/other/haskell/Outputprelude/exp_f.html
Also, float ^ float: http://www.zvon.org/other/haskell/Outputprelude/GG_o.html

>>138 Haskell !=GMP
Also, Haskell cannot perform float^float too, observe
GHCi, version 6.10.2: http://www.haskell.org/ghc/  :? for help
Loading package ghc-prim ... linking ... done.
Loading package integer ... linking ... done.
Loading package base ... linking ... done.
Prelude> 2142.8122^3123.12124324

<interactive>:1:0:
    Ambiguous type variable `t' in the constraints:
      `Integral t' arising from a use of `^' at <interactive>:1:0-22
      `Fractional t'
        arising from the literal `3123.12124324' at <interactive>:1:10-22
    Probable fix: add a type signature that fixes these type variable(s)
Prelude>



______________________________________________
http://xs135.xs.to/xs135/09042/av922.jpg
orbis terrarum delenda est

I love the effort FV puts into his trolls, but I must do this to be fair to the other trolls.

***rootrem.c:153: GNU MP assertion failed: ! (un < pn || (un == pn && __gmpn_cmp
 (up, pp, pn) < 0))

This application has requested the Runtime to terminate it in an unusual way.
Please contact the application's support team for more information.

Thats it,i'm moving back to MAPM & PellesC. I don't have time for buggy GNU shit.



__________________________________
http://xs135.xs.to/xs135/09042/av922.jpg
orbis terrarum delenda est

Can I get a FV-hiding link? I can't find the new version.

Ah forgot,Mapm doesn't work with Pelles C. Is there some other floating point library which have precompiled .lib?



_________________________________
http://xs135.xs.to/xs135/09042/av922.jpg
orbis terrarum delenda est

>>139
Also, Haskell cannot perform float^float too, observe
Prelude> :t (^)
(^) :: (Num a, Integral b) => a -> b -> a
Prelude> :t (**)
(**) :: (Floating a) => a -> a -> a
Prelude> 2142.8122 ** 3123.12124324
Infinity
Prelude> 2142.8122 ^ 3123
Infinity

>>144 This is not Arbitrary Float ^ Arbitrary Float
this is simple double float^^ which is hardware supported and obviously limited to 10^308
Stop being retarded.


__________________________________________
http://xs135.xs.to/xs135/09042/av922.jpg
orbis terrarum delenda est

I'm trying to work around a way to use unsigned long int in GMP/GCC in more complex steps to get the same
effect MAPM does with float^float. The only thing i like is that GMP is faster but it somewhat crash-prone.
the >>141 occured when i tried to write a routine for extracting roots(integer ) and it crashed with roots above ~500 in the middle of the loop and obviously i'm not going to explore this type of programs with GMP.



__________________________________
http://xs135.xs.to/xs135/09042/av922.jpg
orbis terrarum delenda est

>>145
Use CReal, then¹.

¹ Don‘t.

Dear FV,

a ^ 1.2 = a ^ 12/10 = a ^ 6/5 = (a ^ 6) ^ 1/5 = fifth root of a ^ 6

omg integers! How did that happen? MATH SURE IS MAGIC.

Signed,
IHBT

At the moment there 3 options:
1.Use antiquated MAPM(with all its decimal-only quirks)
2.MFPR and other linux-only source libraries, which refuse to install/compile with MinGW(i've tried and they all complain on linker errors and the like)
3.GMP4.1(which lacks several functions) I suspect my version is a bit buggy
I'm searching for precompiled Windows libs for any of these(even more recent GMP would be nice) as all my efforts to compile stuff with minGW fail(and i have to add the whole process is completely user-hostile).


__________________________________
http://xs135.xs.to/xs135/09042/av922.jpg
orbis terrarum delenda est

>>148 Try to take 600+ root and get this >>141



________________________________________________
http://xs135.xs.to/xs135/09042/av922.jpg
orbis terrarum delenda est

My app using files as large integers and takes roots above ~600(actually i've tried like 40000 )
and the float to rational conversion would easily make things like this common: 12281944732492834/32423478324783749832



___________________________________________
http://xs135.xs.to/xs135/09042/av922.jpg
orbis terrarum delenda est

>>151
roots above 600
I have shown you how exponents work. If 600 is giving you problems, then you should know what to do.

>>152 I cannot "Compile new GMP from source" i'm on windows and i'm only using precompiled libs.
Actually i tried to compile MFPR,GMP and several other libraries and all times it failed at ./configure


________________________________________
http://xs135.xs.to/xs135/09042/av922.jpg
orbis terrarum delenda est

error: no acceptable ld found in $PATH
^The above error always shows up


________________________________________
http://xs135.xs.to/xs135/09042/av922.jpg
orbis terrarum delenda est

>>154
Just use a stapler.

The /prog/ without FV is so beautiful.

>>156
s/is/was/ ;_;
at least he's mostly contained to this thread and the ones with /prog/ in the title.

>>154
ld? That just means you need to go here: http://www.ldonline.org/

>>157
I see blanks, blanks!

lol