An Interesting Problem
From: Absque Erus (pirxthepilot_at_canoemail.com)
Date: 03/27/05
- Next message: jstevh_at_msn.com: "Re: JSH: Critical phase"
- Previous message: Ari: "Re: proof of inverse matrix"
- Next in thread: Peter Webb: "Re: An Interesting Problem"
- Reply: Peter Webb: "Re: An Interesting Problem"
- Messages sorted by: [ date ] [ thread ]
Date: 26 Mar 2005 16:58:08 -0800
Hello all,
Due to recent spreading of some diseased laws to my country, brought
(bought?) to us by a certain group of wealthy individuals whose
monetary concern is to control all mechanisms of distribution of
information, I am investigating a method of defeating their schemes in
a final, absolute and irrevocable way ... OK, stop laughing, and read
on.
The method involves creation of a system whereby the data being traded
between participants does NOT contain any sequences of integers which
are "property" of the greed-mongers in question, and furthermore, the
data exchanged cannot be plausibly claimed to be "derived" from the
said "property". Or more precisely, any such claim can be easily and
spectacularly demonstrated to be absurd. And yet the system will allow
for basically any arbitrary data to appear by magic of science just
where it is needed without being explicitly transmitted. Furthermore,
any attempts to outlaw the transmission of the data that is being
transmitted, will result in a ban on all mathematical functions in
domain of integer numbers (which I hope will prove impossible for even
the most moneyed interests).
Additionally, a secondary objective (which I shall call "The Adding
Insult To Injury Feature") is that the proposed system should be MORE
data bandwidth efficient then the existing so-called P2P systems.
Unfortunately, while my understanding of technologies involved is
rather deep, my grasp of computational mathematics is not sufficient to
avoid likely reinventing of the wheel (poorly) on my behalf.
Thus I decided to ask the dwellers of this group whom I guess to be
experts in the area.
The problem is defined in mathematical terms as follows:
Given two (or more) pairs of arbitrary sequences Sc1,Sf1 and Sf2,Sf3 of
integer numbers in range 0-255, what is the least computationally
expensive function f such that Sc1=f(Sf1) and Sf2=f(Sf3)? In other
words I am seeking an algorithm for designing the least computationally
expensive (or close to it) function Y=f(X) where X and Y are domains of
(very large) integer numbers for which I have two (or more)
pre-determined known data points.
Additional considerations are: the sequences will in practice be of
significant length and the method of deriving the function f should
ideally also be not excessively computationally expensive.
Please forgive me if this turns out to be a trivial exercise, after all
I am not a mathematician.
On the other hand should the problem prove interesting, I will on
request provide further details of the scheme and any clarifications as
needed.
Naturally, this method will be used in freely available (GPL) software
and I will duly and prominently display any notices of authorship of
the algorithm(s) if asked to.
AE
- Next message: jstevh_at_msn.com: "Re: JSH: Critical phase"
- Previous message: Ari: "Re: proof of inverse matrix"
- Next in thread: Peter Webb: "Re: An Interesting Problem"
- Reply: Peter Webb: "Re: An Interesting Problem"
- Messages sorted by: [ date ] [ thread ]
Relevant Pages
|
