Re: An Interesting Problem

From: Absque Erus (pirxthepilot_at_canoemail.com)
Date: 03/27/05 

Date: 26 Mar 2005 17:50:33 -0800

> You want a function f(a(n)) = b(n)

Lets look at it in another way:

All I want is to arrive at the sequence Sc1 from Sf1 by means of a
mathematical function.

But there are no restrictions as how that sequence is
stored/represented before processing.

One possiblity is to consider the entire sequence S a single (very
large) number by simply treating the integers in it as digits in a base
256 representation, such as SN (the large number) = S(1) + 256*S(2) +
256^2*S(3) + ...

In that case the function f we seek is simply a function translating
some very large integer numbers.

The only concern is that the function f() has to produce the very large
number Sc1 when presented with Sf1 and *also* produce Sf2 when fed Sf3.
 There are not even specific constraints on the "source" numbers
(sequences) Sf1 and Sf3, although it would be prefferrable to have them
being defined outside the algorithm.

The idea of course is to trade files containing appropriate functions
f() which convert already present "reference" files (large numbers)
into other arbitrary files. But one can treat the sequences (i.e.
pre-process them) in any way which is most convenient for the
algorithm.

 AE

Relevant Pages

  • Re: Chex Wat: Pi is "random" and "not predictable"?
    ... their output sequence. ... The fact is that an algorithm can also be used to ... first was about the probability of finding an apparent match. ... They may be matched within e at an infinite ...
    (talk.origins)
  • Re: an true information theory
    ... > outputs, and figures out that the algorithm must be A1, there ... > there is an infinite number of stages n such that P's guess at ... > sequence of algorithms, strike off every algorithm that appears ... I've read that quantum computing may improve tractability but ...
    (sci.math)
  • Re: best approach to generate random number in java
    ... > to the same initial state, it will produce the same sequence. ... There is a difference between the determinism of an algorithm and the ... > quest to locate the algorithm, using, say, a future quantum computer ... generate all possible binary strings of length 100. ...
    (comp.lang.java.programmer)
  • Re: Q: Algorithm M vs. P of Knuths book
    ... >> another sequence in such a manner that the relationship ... probabilities depends on the size of the array. ... >> to the region of the array), I am not yet sure that Algorithm ... >> venture to say that for most practical situations the ...
    (sci.crypt)
  • Re: Chex Wat: Pi is "random" and "not predictable"?
    ... the sequence appears to be part of a "normal" number or not. ... This compression algorithm can then be used to predict ... If this prediction succeeds, it gains predictive ... predictive value as the string in question increases in size with each ...
    (talk.origins)