Return Styles: Pseud0ch, Terminal, Valhalla, NES, Geocities, Blue Moon.

Pages: 1-4041-8081-120121-160161-200201-

Infinite Compression Explained

Name: FrozenVoid 2009-06-24 10:03

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

Name: Anonymous 2009-06-24 10:07

/prog/ - Invisible Poster's blog

Name: Anonymous 2009-06-24 10:23

>>1
float precision
rational arithmetic d00d

Name: Anonymous 2009-06-24 10:35

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:
Questions from who? Let me understand, because we DON'T read your blog, you post your blogs content here, because we read /prog/, and therefore we'll also read your blogs content. Am I right on this?

file is converted to large integer X(arbitrary length).
By which method? Do you have arbitrary time and memory as well?

2.(X+1)by some scale factor e.g. 10e1000 to get an uppper bound

You have two steps labeled '2'. What is the meaning of this? What does this sentence say? I don't understand it. by some scalar factor what?

3.a search is performed for finding numbers inside that range which are easy to represent via formula.
You're going to search the representation of a number for known patterns then? This method can't be infinitely applied.


Sorry, you're wack. Your algorithm does not work, and it's certainly not 'infinite'.

Name: FrozenVoid 2009-06-24 10:38

>>3 floats can be used in intermediate representation:
suppose i'm compressing a byte(it impossible of course to compress anything that small)
its value is 77 the process is a follows
multiply 77*1000=77000=lowerbound
multiply (77+1)*1000=78000=upperbound
all the numbers between 77000.0000000000...1 and 77999.99999999.... are in the range
finding parameters for formula is next:
 formula e.g. 2^16.25 generates 77935.87748881833, 16.25 and 2(ommited if single power is used) are saved to file
the formula then calculates  77935.87748881833/10000=77.93587748881832 who first byte is 77 which is printed.
________________________________________
http://xs135.xs.to/xs135/09042/av922.jpg
orbis terrarum delenda est

Name: FrozenVoid 2009-06-24 10:43

>>4
[1]"By which method? Do you have arbitrary time and memory as well?"
each byte is converted to decimal and multiplied by 256^position in file.
In current programs it takes 1 second per 100 bytes.(there are libraries which can convert the file in 0.0000001 seconds but they don't work with my compilers, e.g. MPI and GMP)
[2]"You have two steps labeled '2'".
 its insignificant, as they both specify the range.
[3]"You're going to search the representation of a number for known patterns then?"
I'm searching for any numbers which fit inside the range. floats, integers,etc
The formula is to find any of the (infinitely many with appropriate scale factor) numbers which can be computed via formula.
 
 



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

Name: Anonymous 2009-06-24 10:46

>>5
suppose i'm compressing a byte(it impossible of course to compress anything that small)

Formal proof for this? Actually it is possible to compress a byte if the container is larger, like it is possible to compress a nibble if the container is a byte.

formula e.g. 2^16.25 generates 77935.87748881833, 16.25 and 2(ommited if single power is used) are saved to file

In which format is 16.25 represented with less bits than 77? If you don't realize the instant stupidity of your statement, I don't want to waste any more time with you.

Name: why so decimal? 2009-06-24 10:46

>>5
*1000
Just use *1024 and use shift operators.

Name: FrozenVoid 2009-06-24 10:50

>>8 I know about shifts, its decimal only example. regardless.
scale factor is just a determiner for range:
77 can be expanded to any (actually infinity many) ranges without storing any scale factor data.
e.g. 77= 770.0000.. to 779.9999...=7700.000.... to 7799.99999=etc
just the filesize is stored,as its the number of [first]bytes which are relevant.



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

Name: Anonymous 2009-06-24 10:50

>>6
each byte is converted to decimal and multiplied by 256^position in file.

Bytes are converted to decimal? What? Do you store its decimal representation in a string then? What does it mean to convert a byte to decimal? Why do you have to do this to multiply the bytes value with 256^position? Do you know what you're talking about?

In current programs it takes 1 second per 100 bytes.

Irrelevant. This is a non-working algorithm, so you're either lying or you're mistakingly interpreting the results of your code as correct.

I'm searching for any numbers which fit inside the range. floats, integers,etc

I do understand the algorithm. You suppose there's a number k between i and j which can be represented by an expression smaller than the representation of the value v, which is i/d.

Formal proof for this? Your whole algorithm is based on this logic. Can you prove this is true? In fact, it's not. You can give up now, or waste more of your time.

Name: FrozenVoid 2009-06-24 11:02

>>10 I appreciate only constructive criticism. The programs are in development.
There is no "Formal proof", i'm just coding better search mechanisms and improving precision.
When the final program will be ready, it will be optimized and work seamlessly.
The current general representation of algorithms that i explore is >>1 and if you want details of past code
like that "1 second per 100 bytes". its at http://frozenvoid.blogspot.com/2009/06/static-search-with-float-power.html




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

Name: Anonymous 2009-06-24 11:04

0. v: positive integer
1. v = i/d
2. j = i + d
3. i <= k <= j
4. k -> v
5. size(k) <= size(v)


Is what you suggest. For all v?! This simple algorithm, you suppose, has never been thought by anyone else, it is now conceived by you, in a moment of epiphany after reading SICP no doubt, and now, after possessing such knowledge, you FOUND THE ALGORITHM THAT NOT ONLY REPRESENTS ANY NUMBER IN LESS BITS, BUT IT ALSO RUNS FAST! WOW! You also want us to accept it as is, and you don't provide any proof, formal or informal. IN FACT, YOU DON'T PROVIDE EVEN A HINT THAT YOU'VE DONE SUCH WORK OR THINKING.


A CROOK, YOU ARE.

Name: Anonymous 2009-06-24 11:08

>>11
I can't read that link! Get some damn formatting.

Name: Anonymous 2009-06-24 11:09

>>12
sure is gettan trolled in here

Name: Anonymous 2009-06-24 11:15

>>11
I appreciate only constructive criticism
I appreciate people who admit their mistakes.

The programs are in development.
Programs? There's many of them? What's the difference of each?

When the final program will be ready, it will be optimized and work seamlessly.
What optimization methods do you have in mind? *WHY* will it work seamlessly? Is this a guarantee coming from you or you actually have some evidence for this? You seem certain about something you have no proof of. That's a belief, a delusion. Remember when I said that some posts ago?

I looked at your code, and I can't read it. I don't plan to learn about a bignum library and reindent your code just to show you this which you're trying to do can't work. Plus, your code has many bugs and I'm wondering if you can write C without bugs at all.

Name: Anonymous 2009-06-24 11:59

>>13
>>15
EXPERT SEEING HIS POSTS

Name: Anonymous 2009-06-24 13:13

>>12,15

come on FV, share your wisdom with us, bump, for once.

Name: FrozenVoid 2009-06-24 13:52

I'm currently working on bytes_to_decimal_string conversion optimizations(old one was too slow).
the function is meant to convert file to integer in fastest possible time(so i'm not using mapm for it).


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

Name: Anonymous 2009-06-24 14:05

>>18
First: why decimal, second: WHY A STRING

WHAT THE HELL IS WRONG WITH YOU!!!

Name: FrozenVoid 2009-06-24 14:19

MAPM library expects its input in decimal ASCII strings only(its output is decimal only too).
old method was to pass bytes and buffer positions to mapm functions to multiply them one by one(which is slow ).
I'm trying to find a method to convert to decimal faster. this is the old code:

char *inpbuf=malloc(filesize); fread(inpbuf,1,filesize,input); fclose(input);
M_APM decstr=m_apm_init();m_apm_set_string(decstr,filler);
if(DEBUG){printf(CONVERTMSG);}
//store multiplier,store current byte,current byte multiply,current decstr copy,
M_APM pow2store=m_apm_init();m_apm_set_string(pow2store,filler);
M_APM pow2base=m_apm_init();M_APM bytexpow=m_apm_init();m_apm_set_string(bytexpow,filler);
M_APM decstrcopy=m_apm_init();m_apm_set_string(decstrcopy,filler);
//byte multiplier (2^8)^(pos from end:0=1) first bit=1,
M_APM pow2exp=m_apm_init();m_apm_set_long(pow2exp,TWOLONG);
unsigned long int curbyte;unsigned long int curpow;unsigned long int pos;

for(pos=(filesize-1);pos;pos--){
curbyte=(unsigned long int)inpbuf[pos];
if(DEBUG){if(pos%CONVERTCHUNKSIZE==0){printf("Processed %u of %u bytes\n",filesize-pos,filesize);}}
//curent byte as int
m_apm_set_long(pow2base,curbyte);
//this is multiplier for current byte (2^8)^pos=2^(pos*8)
m_apm_integer_pow_nr(pow2store,pow2exp,8*((filesize-pos)-1));
m_apm_multiply(bytexpow, pow2base, pow2store);
m_apm_copy(decstrcopy,decstr);
m_apm_add(decstr,decstrcopy,bytexpow);}
printf("Processed %u of %u bytes\n",filesize-pos,filesize);
if(DEBUG){printf(CONVERTOK);}
m_apm_copy(decstrcopy,decstr);




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

Name: Anonymous 2009-06-24 14:21

>>20
Fuck me. [code] tags please? Also, you use an inordinate number of superfluous curly braces.

Name: FrozenVoid 2009-06-24 14:25

>>21 I always use curly braces, be it C,JavaScript or Haskell



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

Name: FrozenVoid 2009-06-24 14:31

If GMP or MPI compiled with my code, i would dedicate more time to search algorithms.


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

Name: Anonymous 2009-06-24 14:32

Troll or retard, you decide.

Name: Anonymous 2009-06-24 15:05

I'm interested in helping this along because I'd like to see what happens when the the pleasure of realizing finally comes.

Name: Anonymous 2009-06-24 15:07

"GRUNNER"

Name: FrozenVoid 2009-06-24 15:09

>>25
 Can you explained why DMC says this:
 
OPTLINK (R) for Win32  Release 8.00.1
Copyright (C) Digital Mars 1989-2004  All rights reserved.
D:\Program Files\dm\bin\..\lib\gmp.lib Offset 00000H Record Type 0021
 Error 138: Module or Dictionary corrupt


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

Name: Anonymous 2009-06-24 15:16

>>27
LOL WTF are you using DMC for? And Windows nonetheless! A Linux box is a programmer's box. The only programming worth being done in Windows is .NET programming; fuck MFC/Win32. If you're just writing a command-line program, you'd be better off using Linux and GCC.

Name: FrozenVoid 2009-06-24 15:21

>>28 Unfortunately i can't get GCC to work. The install seems corrupted.
"Linux box is a programmer's box". Programming is more of a hobby for me.

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

Name: FrozenVoid 2009-06-24 15:25

I like those aspects of programming which assists with hacking or provide immediate entertainment/utility(like e.g. data compression or screensavers). Programmers for sake of writing programs isn't appealing to me much.

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

Name: Anonymous 2009-06-24 15:28

>>30
immediate entertainment [...] screensavers
You just made me laugh for the first time.

Name: FrozenVoid 2009-06-24 15:31

>>31 Especially those fractal screensavers. Click on the .scr file and watch.

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

Name: Anonymous 2009-06-24 15:37

>>31
you should get out more

Name: Anonymous 2009-06-24 15:42

>>33
No, as in, that's the first time I found him funny.

Name: FrozenVoid 2009-06-24 16:17

Progress report : I'm trying to get into M_APM struct format to copy bytes there(these dirty hacks will probably crash), instead of slow conversions.



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

Name: FrozenVoid 2009-06-24 16:27

Apparently M_APM.m_apm_data uses bytes->[x][x] digits conversion.i.e. 100 digits per byte. and will also require a conversion



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

Name: Anonymous 2009-06-24 16:29

>>30
hacking
You keep using that word.  I don't think you could hack you're way out of a wet paper dick.

Name: FrozenVoid 2009-06-24 16:30

something like [byte/10]:[byte%10] should work.brb.



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

Name: Anonymous 2009-06-24 16:42

The cognitive dissonance I'm getting from this thread causes anxiety within me. It seems like such a silly idea, but I don't have the wherewithal to prove that this can't possibly work.

So I'll give you a month to try "wow" us with something. A working demo, benchmarks, a complete pen-and-paper encoding and decoding session, ANYTHING.

Thank you very much indeed.

Name: Anonymous 2009-06-24 16:45

To the OP: have you posted on comp.compression or comp.theory about this? Wouldn't it be a good idea to first check if the idea is sound, in the interest of not wasting time?

Name: Anonymous 2009-06-24 16:54

>>37
Shh FrozenVoid is 1337 hax0r

Name: Anonymous 2009-06-24 17:08

>>39
You don't need any "wherewithal" to prove that this can't possibly work.

It was proven a decades ago (and it's an obvious, utterly trivial proof), and the fact that /prog/ gets trolled so easily is really disheartening.

Data compression is always one of the areas that attracts the most stupidity for some reason. And /prog/ is attracted to the low hanging fruit of proving obviously retarded stuff wrong.

You fags are sure getting trolled, and you deserve every bit of it. Shame that /prog/ gets ruined in the meantime, for I can barely stand to look at this faggotry now.

Name: Anonymous 2009-06-24 17:14

>>42
I don't think you quite understand what sage is for. Only use sage for posts you don't feel are worthy of bumping the thread. Please refrain from using sage as a sign of disapproval; thank you. :)

Name: Anonymous 2009-06-24 17:20

>>43
Was that reply worth a bump?

Name: Anonymous 2009-06-24 17:32

>>42
We have a saying in /prog/, "If in a thread you don't know who the troll is, YHBT". I think this applies pretty well here, as you clearly can't tell. Everyone here already knows that infinite compression is impossible, but we derive great humour from ignoring that and playing along with that idiot.HIBMT?

Name: Anonymous 2009-06-24 17:48

>>44
I actually meant to use sage, but I genuinely forgot.

Name: Anonymous 2009-06-24 17:54

>>45
Actually, the OP's idea actually has some merit. I suppose if you were to make a comparison, the OP reminds me of Howard Roark or Hank Rearden, for those of you familiar with Ayn Rand. A true individualist, constantly innovating and never sitting still.

Name: Anonymous 2009-06-24 18:07

>>47
I lol'd

Name: Anonymous 2009-06-24 20:12

>>47
you know who also never sits still? kids with ADHD

Name: Anonymous 2009-06-24 21:14

>>5
Why would you "compress" a byte to a float power? A float power takes 4 bytes to store, your compression actually inflated it by 3 bytes, a 300% size increase.

Well, we'll wait until you can actually get it to work.

IHBT

Name: Anonymous 2009-06-24 22:40

>>50
Don't tell him that...

Name: Anonymous 2009-06-25 0:07

>>50
The idea doesn't work but this is not a good criticism. The point was illustrative, it even said in the post it was not meant for a single byte.

Name: FrozenVoid 2009-06-25 3:37

New decimal conversion function complete performance ~1mb/sec (x100000 faster)

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

Name: Anonymous 2009-06-25 5:03

>>53
come back when you've solved this: http://marknelson.us/2006/06/20/million-digit-challenge/

Name: FrozenVoid 2009-06-25 5:04

never mind it appears to corrupt files. i'm going to try to update to latest GCC and try it again.

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

Name: Anonymous 2009-06-25 5:50

>>55
yes, obviously GCC is the culprit

Name: Anonymous 2009-06-25 6:01

>>56
>>54
dont see his posts

Name: Anonymous 2009-06-25 6:11

Such hilarity. It's even funnier that he doesn't see what's wrong with his idea, and even prematurely implements it without verifying the soundness of the idea, and he blames the compiler for what is likely faults within the code and the actual concept (try another compiler if you believe it's the compiler's fault). We could just ignore him (forever) until he produces something which works and can be tested.

Name: Anonymous 2009-06-25 6:13

oh, and don't bother explaining this with any theory as reasoning with math is impossible with FV, after all he still believes that 0.9 != 1 even after multiple proofs being shoved in his face.

Name: Anonymous 2009-06-25 6:14

>>57
don't bump his threads

Name: Anonymous 2009-06-25 6:15

>>60
IT WAS TOP ANYWAY FAG

Name: Anonymous 2009-06-25 6:18

>>59
well he's 16, he doesn't need to listen to anybody because he is always right

Name: FrozenVoid 2009-06-25 6:21

>>58
I never compiled with GCC(previous GCC installs get corrupted and fail). I'm installing it to link with GMP.
Please read posts more carefully next time.


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

Name: Anonymous 2009-06-25 6:23

>>61
stop bumping the top thread.
where are all these perverts with this weird thread-bumping fetish coming from?

Name: Anonymous 2009-06-25 6:25

>>63
HOW ABOUT _MY_ POSTS? YOU FUCKING FAGGOT PIECE OF SHIT USELESSTRASHMOTHERFUCKRETRAINANAL

Name: Anonymous 2009-06-25 6:28

you can't fool others if you're fooling yourself

Name: Anonymous 2009-06-25 6:31

>>63
i lol'd.
invisible poster is telling US to read his posts more carefully, completely missing his flagrant hypocrisy

Name: Anonymous 2009-06-25 6:39

invisible poster is telling US to read his posts more carefully, completely missing his flagrant hypocrisy
how do you know what he's telling us if his posts are invisible?

Name: Anonymous 2009-06-25 6:41

>>68
it's a nickname, shit for brains.
i told you last time FV.
i haven't had the /prog/fixer on for some time now

Name: FrozenVoid 2009-06-25 7:11

GMP is finally working.

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

Name: Anonymous 2009-06-25 8:26

i didnt see his posts

Name: FrozenVoid 2009-06-25 9:05

Does GMP has a way for using float exponents like 2^2.123211?
 i can see only mpf_pow_ui (mpf_t rop, mpf_t op1, unsigned long int op2)



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

Name: FrozenVoid 2009-06-25 9:09

This is serious limitation, as i've already converted half of my current code to GMP.


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

Name: Anonymous 2009-06-25 9:20

>>73
Your knowledge of math is a serious limitation.

Convert 2.123211 to a rational.

Name: FrozenVoid 2009-06-25 9:35

>>74 Converting to rational wouldn't change the fact its not unsigned long int as its required.
http://gmplib.org/manual/Rational-Arithmetic.html#Rational-Arithmetic provide no rational or floating point exponents.


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

Name: Anonymous 2009-06-25 9:39

>>75
I will nudge you with programming tips, but if you don't know math, why even fucking bother with this shit?

Name: FrozenVoid 2009-06-25 9:42

>>76 Well, what is the alternative of raising a number to ^floating.point number if there is none provided?



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

Name: Anonymous 2009-06-25 9:43

>>77
Research exponentiation. Be enlightened.

Name: FrozenVoid 2009-06-25 9:47

Fine, I'm going to use MAPM for computations and GMP for data conversion.
Because it has this simple function float^float. and GMP has mpz_out_str (FILE *stream, int base, mpz_t op)

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

Name: FrozenVoid 2009-06-25 9:50

Unfortunately it wouldn't work.
../../lib/gcc/mingw32/3.4.5/../../../mapm.lib: file not recognized: File format
not recognized

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

Name: Anonymous 2009-06-25 9:53

>>80
/prog/ - Technical Support and Google Alternative

Name: FrozenVoid 2009-06-25 9:54

hmm, it could be used as separate module to call,system("convert.exe filename")

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

Name: FrozenVoid 2009-06-25 9:55

1st program will use GMP and perform data conversions.
2nd will use MAPM to implement algorithms.

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

Name: Anonymous 2009-06-25 9:59

>>82
system() considered harmful
>>83
please keep pointless posts like this confined to within your blog.

Name: Anonymous 2009-06-25 11:03

BROTIP: dont see his posts

Name: Anonymous 2009-06-25 11:34

I have a better idea:

Since pi is irrational, eventually you'll encounter any possible combination of numbers. So, just search for the numbers that correspond to your file and save the position where you found the numbers.

For unpacking you use a digit-extraction algorithm.

TAAAAAAAADAAAAAAAAAAAAAAAAAA

Name: FrozenVoid 2009-06-25 12:11

mpz_export crashes my program.
>>86 This is technically impossible:the probability of finding such strings >~10 bytes is astronomically low.

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

Name: Anonymous 2009-06-25 12:14

>>86
What if the position needs a lot more space to store than the original data. There's no guarantee you'll find it at all ( you can have irrational numbers which exhibit very well defined patterns, yet don't belong in Q), and even if you found it, you may need more data to store the position than the original data you were compressing.

IHBT

Name: Anonymous 2009-06-25 12:18

>>87
>>88
MY PLANS FOR WORLD DOMINATION WON'T BE SPOILED BY BRATS LIKE YOU

Name: Anonymous 2009-06-25 13:38

>>87
This is technically impossible:the probability of finding such strings >~10 bytes is astronomically low.
I'd almost believe you actually know this in some traditional sense of the word ``know'' except that you cannot figure out how to use GMP's functions to calculate with rational exponents, which pretty much guarantees your knowledge of math is limited to middle-school pre-algebra.

Thankfully, everyone else here knows it, too.

Name: Anonymous 2009-06-25 14:58

>>88
I always hypothesized that the size of an index into an irrational number (or just any piece random data in general) to specify some content will be, on average, strictly bigger than the data itself (maybe some constant higher).

Name: Anonymous 2009-06-25 15:04

So, write each byte as three decimal digits, concatenating them after "0.". For example "hello" would be 0.104101108108111. Now you can store an arbitrary amount of information by just storing a number between 0 and 1. For example, you could make a mark at the correcponding place in an 1 inch ruler. This is truly INFINITE COMPRESSION; it's easy to implement, and very fast.

Name: FrozenVoid 2009-06-25 15:38

>>90 Rational exponents or w/e idiotic suggestion you propose are adding another layer of calculations:
see instead of float^float (with set precision), i'll have to
((float^long int)^long int)^long int)^long int)^long int)^long int)...../(float^long int)^long int)^long int)^long int)^long int)
 this process is proportional to the power size, and each steps loses precision.


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

Name: Anonymous 2009-06-25 15:44

>>93
i hope those are unsigned

Name: FrozenVoid 2009-06-25 15:55

>>94
Only unsigned long ints. its specified in the only function which takes 'arbitrary' powers.
— Function: void mpf_pow_ui (mpf_t rop, mpf_t op1, unsigned long int op2)
using numbers larger then ulong and in floating point, requires a "new process",( all when all normal libraries have anyfloat^anyfloat) which is typical of "Lunix mindset" of "If it doesn't work you aren't coding hard enough".
The result would be huge waste of CPU time and float precision.


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

Name: FrozenVoid 2009-06-25 16:02

Comparision:
mp_expt(a, b, c)     <--MPI
 m_apm_pow(apmresult, decimal_places, apm_x, apm_y)  <--MAPM
(a process involvign spllitting the float power,finding amount of computations,performing a sequence of exponentiations and divisions, etc <--GMP

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

Name: FrozenVoid 2009-06-25 16:24

Progress: Conversion utility done. Will be published shortly.

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

Name: Anonymous 2009-06-25 17:07

>>93
Another layer of calculations? How, exactly, do you suppose floating point exponentiation works?

Name: Anonymous 2009-06-25 18:13

unsigned my anus

Name: Anonymous 2009-06-25 18:19

100 GET YES!!!! LOL

Name: FrozenVoid 2009-06-26 2:32

why mpz_out_str(output, 10, data); crashes and
mpz_out_str(output, 16, data); does not?


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

Name: FrozenVoid 2009-06-26 2:52

Btw i'm developing new algorithm to work with GMP integer powers. It could work with some new ideas,without sacrificing precision.

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

Name: FrozenVoid 2009-06-26 3:56

Fuck that Shannon guy up the ass with a rolled-up copy of SICP.

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

Name: Anonymous 2009-06-26 4:45

I've been thinking that I could make my algorithm compress files 20% more just by integrating it in with a matrix based encryption algorithm.

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

Name: FrozenVoid 2009-06-26 5:10

ok, that didn't work.
my next plan is to assign an arbitrary number to every combination of bits, the receiving computer will be equipped with a list of every number and its corresponding value.
therefore, you can email someone a number (say, 102) and the receiver can look through they're data dictionary and find that 102 = original data (say, 11010101000100101011110101010000101011110101010100101010101101010100010010101111010101000010101111010101010010101010110101010001001010111101010100001010111101010101001010101011010101000100101011110101010000101011110101010100101010101010101000100101011110101010000101011110101010100101010101).
infinite compression here i come!!!

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

Name: Anonymous 2009-06-26 6:25

I love you FV and all you trolls who go by the name of him.

<3

Name: FrozenVoid 2009-06-26 7:21

>>105 Thats preposterous. The index of every number is just the number itself.



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

Name: FrozenVoid 2009-06-26 8:01

I ponder if releasing the current code is worthwhile,since  its decoding algorithm isn't working yet( i haven't figured out why it corrupts files) and will take a long time to debug(not to mention dozens of bugs i fixed today).



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

Name: FrozenVoid 2009-06-26 8:15

>>107
no, "101001010010010101010100" takes up 24 bytes, but "10822996" only takes up 8.
once again you overlook the facts and talk without thinking


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

Name: Anonymous 2009-06-26 8:21

>>109
no data saved as binary values is way smaller than an int.

Name: Anonymous 2009-06-26 8:22

This thread needs stickied.
>>109 That was golden :)

Name: FrozenVoid 2009-06-26 8:23

>>110 Hes obviously trolling.
 Its just represented in different base on screen, the numbers are the same.



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

Name: Anonymous 2009-06-26 8:24

>>109
no data saved as binary values is way smaller than an int.>>112
uhu...sure

Name: FrozenVoid 2009-06-26 9:41

Appears to be working, no crashes so far. Corruption problem solved.
I'll have to remove debug code before publishing.

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

Name: Anonymous 2009-06-26 9:55

This thread is so confusing. I don't know what's invisible and not invisible anymore.

Name: FrozenVoid 2009-06-26 9:56

You can check out the code here: It works, decodes, and searches(only in integer powers of course).
http://frozenvoid.blogspot.com/2009/06/integer-power-search.html

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

Name: FrozenVoid 2009-06-26 11:02

Fixed corruption error when encoded in base36. New version(already in blog) is base10 exclusive.



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

Name: Anonymous 2009-06-26 11:18

>>116
Of course!

Name: FrozenVoid 2009-06-26 14:08

new version[1] coming tommorow.
I'm trying to optimize the code without sacrificing search space(which is scarce enough in int powers).


[1]with dynamic range extension inside the precision loop
______________________________
http://xs135.xs.to/xs135/09042/av922.jpg
orbis terrarum delenda est

Name: Anonymous 2009-06-26 14:21

Everyone, just GTFO. This thread is shit. Those who are not sageing this thread are shit. Please die.

Name: Anonymous 2009-06-26 14:47

int powers

Name: Anonymous 2009-06-26 15:07

>>120
gay you just lost the game

Name: Anonymous 2009-06-26 15:39

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

Name: FrozenVoid 2009-06-26 17:48

>>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

Name: Anonymous 2009-06-26 18:03

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

Name: FrozenVoid 2009-06-27 1:43

>>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

Name: FrozenVoid 2009-06-27 8:23

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

Name: Anonymous 2009-06-27 8:29

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

Name: Anonymous 2009-06-27 12:55

>>38
You're an anus!

Name: Anonymous 2009-06-27 13:38

I'M HELPING HIM

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

Name: FrozenVoid 2009-06-27 14:28

>>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

Name: Anonymous 2009-06-27 15:08

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.

Name: Anonymous 2009-06-27 16:33

>>131
IT'S CALLED THE exp FUNCTION

Name: FrozenVoid 2009-06-27 16:59

>>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

Name: Anonymous 2009-06-27 17:18

>>132
Have you tried using eval?

Name: Anonymous 2009-06-27 17:34

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

Name: Anonymous 2009-06-27 19:00

>>132
Might I suggest adding more parentheses?

Name: Anonymous 2009-06-27 19:01

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

Name: FrozenVoid 2009-06-28 1:58

>>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

Name: Anonymous 2009-06-28 5:08

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

Name: FrozenVoid 2009-06-28 8:39

***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

Name: Anonymous 2009-06-28 9:16

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

Name: FrozenVoid 2009-06-28 11:44

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

Name: Anonymous 2009-06-28 12:07

>>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

Name: FrozenVoid 2009-06-28 12:25

>>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

Name: FrozenVoid 2009-06-28 12:31

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

Name: WHY AM I SEEING HIS POSTS 2009-06-28 13:18

>>145
Use CReal, then¹.

¹ Don‘t.

Name: Anonymous 2009-06-28 13:26

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

Name: FrozenVoid 2009-06-28 13:35

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

Name: FrozenVoid 2009-06-28 13:36

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



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

Name: FrozenVoid 2009-06-28 13:39

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

Name: Anonymous 2009-06-28 14:51

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

Name: FrozenVoid 2009-06-28 15:03

>>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

Name: FrozenVoid 2009-06-28 15:07

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

Name: Anonymous 2009-06-28 15:11

>>154
Just use a stapler.

Name: Anonymous 2009-06-28 15:32

The /prog/ without FV is so beautiful.

Name: Anonymous 2009-06-28 16:21

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

Name: Anonymous 2009-06-28 17:26

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

Name: Anonymous 2009-06-28 17:31

>>157
I see blanks, blanks!

Name: Anonymous 2009-06-28 21:23

lol

Name: FrozenVoid 2009-06-29 8:25

current code can be downloaded at : http://frozenvoid.blogspot.com/2009/06/static-integer-power-search.html


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

Name: FrozenVoid 2009-06-29 9:24

If i had precompiled MFPR .libs on windows it'll make the search much more efficient(in terms of number of stored floats, not speed)



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

Name: FrozenVoid 2009-06-29 9:27

Function: int mpfr_pow (mpfr_t rop, mpfr_t op1, mpfr_t op2, mp_rnd_t rnd)
^this is the function i need


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

Name: Anonymous 2009-06-29 10:01

If only there were some mathematical function where one could capture the exponent in some base, instead of searching. Why, god, why is math so hard????????

Name: FrozenVoid 2009-06-29 10:07

>>164 search needs fast loops and fast operations.
The MPFR and GMP use optimized assembly: I cannot hope to achieve their performance with some hack to approximate floating point powers.



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

Name: FrozenVoid 2009-06-29 10:10

Just for example, imagine exponentiation of  1.0000000000113111098123382013727423894 by 2130706432.31209383236218736284234



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

Name: Anonymous 2009-06-29 11:28

>>166
OMG that's the excel file representing all my banking information!!

Name: FrozenVoid 2009-06-29 11:58

>>167  this number could be a file or it could be just a part of series of such numbers which converge(and my compression is dependent on methods for such convergence) into a file. 



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

Name: Anonymous 2009-06-29 18:05

(define continued-faction
    (λ(x)
      (let iter ((val 1) ; needs some work!
                 (lst empty)
                 (x x))
        (cond ((= x 1) (reverse (cons 1 lst))) ; reverse not necessary but
              ((= x 0) (reverse lst)) ; it looks nicer this way
              ((> (factorial val) x) (iter 1 (cons (- val 1) lst) (- x (factorial (- val 1))))) ; needs some memoization!
              (else
                (iter (+ 1 val) lst x))))))

(define collapse-cf!
 (λ(rep)
   (apply + (map factorial rep))))

> (continued-faction 12131231454)
(13 12 12 12 12 12 12 12 12 12 12 12 12 11 11 11 10 10 10 10 10 10 10 10 10 10 8 8 8 7 7 7 7 7 7 6 6 5 5 5 4 4 3)

Shoot!

Wait, I know, the problem is in the factorial function. I'll just use the gamma function, that way I can use floats, whose magickal compression powers are well-documented. Does anyone know of a free gamma function library call with arbitrary-precision inputs that I can use in Scheme? Thanks.

Name: Anonymous 2009-07-24 4:48

Where's mah compression?

Name: =+=*=F=R=O=Z=E=N==V=O=I=D=*=+= !frozEn/KIg 2009-07-24 5:50

>>170 Not in active development. I'm concentrated on the game.



_______________________________________
http://xs135.xs.to/xs135/09042/av922.jpg
The press does not tell us what to think, it tells us what to think about.

Name: Anonymous 2009-07-24 9:33

>>171
the game

FFFFFFFFUUUUUUUUUUUUU-

Name: Anonymous 2009-07-24 9:43

>>172
back to /the game/ please

Name: Anonymous 2009-07-24 21:05

>>171
You'll need to have it worked out by then to deliver the content with peak efficiency.

Name: =+=*=F=R=O=Z=E=N==V=O=I=D=*=+= !frozEn/KIg 2009-07-25 2:35

>>174 Content is procedurally generated. No need for compression.



________________________________________
http://xs135.xs.to/xs135/09042/av922.jpg
When everyone thinks the same, nobody is thinking.

Name: Anonymous 2009-07-25 5:41

PUBLIC SERVICE ANNOUNCEMENT:

20721 IS NOT BEING CRAPFLOODED

Name: Anonymous 2009-07-25 10:26

PUBLIC SERVICE ANNOUNCEMENT:

20721 IS NOW BEING CRAPFLOODED
Fixed

Name: Anonymous 2009-07-25 10:37

>PUBLIC SERVICE ANNOUNCEMENT:

20721 IS NOW HAX'D ANUS
Fixed

Name: Anonymous 2009-08-16 1:48

Lain.

Name: Anonymous 2009-08-16 2:03

Lain.

Name: Anonymous 2009-08-16 2:15

Lain.

Name: Anonymous 2009-08-16 2:34

Lain.

Name: Anonymous 2009-08-16 2:34

Lain.

Name: Anonymous 2009-08-16 3:07

Lain.

Name: Anonymous 2009-08-16 3:13

Lain.

Name: Anonymous 2009-08-16 3:22

Lain.

Name: Anonymous 2009-08-16 3:23

Lain.

Name: Anonymous 2009-08-16 3:49

Lain.

Name: Anonymous 2009-08-16 4:03

Lain.

Name: Anonymous 2009-08-16 4:21

Lain.

Name: Anonymous 2009-08-16 6:29

Lain.

Name: =+=*=F=R=O=Z=E=N==V=O=I=D=*=+= !fRoZeNHN4I 2009-08-20 12:28

I personally use Notepad2 and avoid any "makefiles"(which i consider bloated and poor design)[1]

I use one include file for everything.
#include "void.h" //handles all the common functions,#defines,#ifdefs and #includes

Anything which uses makefiles is defective Sepples-level shit.
All the C code posts on my blog are void.h merged with somefile.c
-
References
1. >>1250330533/ posts 10,12

Name: Anonymous 2010-11-26 13:05

Name: Anonymous 2011-02-03 3:14

Name: Anonymous 2011-03-01 7:42

[b][i][o]ENTERPRISE QUALITY[/o][/i][/b]asdfadf

Name: Anonymous 2011-03-20 18:15

Name: Anonymous 2011-03-20 18:23

Oh, look, it's this again!

Name: Anonymous 2011-03-20 18:53

ONE WORD PIGEONHOLE PRINCIPLE. BEND OVER.

Name: Anonymous 2011-03-21 4:28

GREATEST THREAD EVER

Also, dubs

Name: Anonymous 2011-03-21 6:49

tachyons

Name: Anonymous 2011-03-21 6:49

The problem with math is: mathematician uses a mathematical metaphor to describe some concept. The metaphor isn't the thing he describes. But math allows one to take the metaphor, and run with it, making arguments that are built entirely on metaphor, but which bear no relation to the real underlying concept. And he believes that whatever conclusions he draws from the metaphor must, therefore, apply to the original concept.

Name: Anonymous 2011-03-21 6:49

Suppose we loosely define a religion as any discipline whose foundations rest on an element of faith, irrespective of any element of reason which may be present. [Atheism], for example, would be a religion under this definition. But mathematics would hold the unique position of being the only branch of theology possessing a rigorous demonstration of the fact that it should be so classified. -- H. Eves, Mathematical Circles, Boston: Prindle, Weber and Schmidt, 1969.

Name: Anonymous 2011-03-21 6:52

The mind of man being finite, when it treats of things which partake of infinity, it is not to be wondered at if it run into absurdities and contradictions, out of which it is impossible it should ever extricate itself, it being of the nature of infinite not to be comprehended by that which is finite. -- George Berkeley

Name: Anonymous 2011-03-22 19:20

consider a compression algorithm to be a function from the set of non-negative integers onto the set of non-negative integers

suppose there exists a compression algorithm f such that for all x less than some positive integer k, 0 <= f(x) < x. then consider S = { x in Z | 0 <= x <= k }. Then f(S) = { f(x) : x in Z | 0 <= x <= k } and for any f(x) in f(S), 0 <= f(x) < x <= k, 0 <= f(x) < k.  Then, by counting, |f(S)| < k+1, but |f(S)| = k, so f cannot be one-to-one and f is not invertible.

any compression algorithm that reduces the size of every input of less than a certain size is not invertible, i.e. it must be lossy.

Name: Anonymous 2011-03-22 19:30

>>205see>>199

Name: Anonymous 2011-06-22 10:25

this thread is fun

Name: Anonymous 2011-06-22 10:54

this thread is redundant

how many of these are there? four?

Name: Anonymous 2011-06-22 10:58

btw almost any data could be compressed lossy in theory. Even code, well certain code, since there are several instructions which can accomplish the same thing.
Think of the many ways to nop()

Name: Anonymous 2011-06-22 15:34

RISE FROM YOUR GRAVE!

Name: ENTERPRISE COMPRESSION 2011-06-23 19:35

>>209
btw almost any data could be compressed lossy in theory

Let f be a compression algorithm such that for all x in Z, f(x) = 0

Name: Anonymous 2011-06-23 20:31

>>211
You've violated my patent. Prepare your anii.

Name: Anonymous 2011-06-23 21:01

Hello I want to stay anonymous and I want to explain why no one who is serious will actually do this. To begin I was reading over some old AIM (Instant Messenger) logs from 1999 based on what I and this german kid used to talk about.. now I am 25 years old and still don't understand half of the things he used to write to me but it all comes down to this, at the age of 15 as he states and checked by his DOB profile, I cannot get in touch with him anymore but he lived a crazy life don't know if he is in jail now or dead. So let me explain a few things he was a social outcast he used to talk about how easy he could control girls without even talking to him just by clapping his hands and staring at them he would get them to have anal sex with him. Don't stop reading because of that part it's funny I haven't understood what anal sex even met when I was 15 haha. He was socially awkward to talk to becasue of his vocabulary I can't say I was the best influence on him either when ever he used to talk in big words I would say just thats awesome and laugh and thats how it conversations ended. He used help me in magicially turning any shareware program into a freeware and tell me to enjoy it =]. Now I figured out he was a hacker. He also used to talk about how he takes some kind of drugs which induced attention deficit disorder which was half of the key and the other half was empirically (still have problems understanding what this ment) he needed to become into a millionaire by the age of 17 he never logged in AIM after that point he did mention he was rich. I don't know what made him into a hacker but he could take any program apart and recreate the source code to it in less then a week thats what he did to turn RICH and I was a big part of him becoming rich as I told him about this cool software which can detect letters in pictures like a human brain back to text now called OCR (optical character recognition) it was pretty primitive at that time and was a shareware, he quickly made it a freeware for me and continnued to turn it back to source code and work on improving it, later patenting his improvement at a VERY young age i may say 16!. Not sure exactly what he patented it since it was already patented I believe? but he started to license it to websites which were for blind/color blind people, which he later said after I asked him that blind people were definetly not using them it was for automated mail hackers. Thats pretty much the story I have logs here which are still VERY cryptic for me to understand and I'm pretty dang mature. Most of them talk about compression and life and a bunch of other things about space and aliens and things I found useless. He states some funny things he must of been a bit immature back then like he writes that life is just a closed circuit with in a cycled loops. I think he ment environmental evolution? rofl If I could still talk to him I'd comment about that by saying yes life is a cycle :P but its no dang circuit its but its a process of SEX, baby then and age which gives wisdom lol. His compression theories talked about how in life the compression take many cycles to unpack and it may take years for it to fully unpack things that could be done in just a month using a CPU. Haha yah he was pretty nutty talked about evolution I am guessing. I won't go into much details here because I'm still trying to understand half of his theories maybe I could patent some of them and get rich myself.

But I wrote all this to tell you that hackers could turn programs into source code so don't risk it even though hackers may be crazy like this guy but they exist.

I'm learning Visual Basc 6 and I may be able to recreate what this german guy was talking about near the future at the moment I'm struggling with bitwise stuff and loops at the moment it's progress.

Name: Autist 2011-06-23 21:04

>> 209

btw any data could be compressed losslessy in theory:
Let S be a infinite set of all possible files, i and j be natural numbers, f and g be relations f : S → N and g : N → S such that for any file x in S, f(x) = i, g(i) = x, and if i ≠ j then g(i) ≠ g(j), and f(g(i)) ≠ f(g(j)). WTF is that?!

If I define a “file” being a infinite sequence of 0's and 1's (something like streams, let's say it's an AP), then can I claim an “infinite compression ratio” for this file?

Name: Autist 2011-06-23 21:12

>>214

214' autist: Defining what a file is would be nice...
214' autist: I missed LATEX so much!

Name: Anonymous 2011-11-13 15:06

LOL! I JUST HAD A DESU VU READING THIS THREAD!!

Name: Anonymous 2011-11-13 15:38

>>214
You don't seem to understand the concept out countability you idiot. Geeze, I swear you're as dumb as frozenVoid.

In order to statisfy part of the countability requirement, all you have to do is define a relation

g: N -> S

Having

f: S -> N

indicates that you are just like your gay lover frozen retard. Ie, a minimum wage faggot.

Then you define i and j to be a set of numbers in N. In other words, having something like

g(i) = x

indicates that you have no fucking clue as to what is going on.

Now, if you can show that there is a some relation g: N->S such that it is both surjective and injective, then you can say there exists a file such that it has an infinite sequence of 0's and 1's.

Cripes you suck. Now go help frozenRetard scrub those toilets you fucking jewish mental midget.
Don't change these.
Name: Email:
Entire Thread Thread List
All trademarks and copyrights on this site are owned by their respective parties. All comments and posts are the responsibility of their own posters.
- Tinychan + 2ch Mode -