Just wondering about your thoughts about using C++ to design and implement a fractal operating system. How easily could C++ manage to inplement this? Perhaps a more heavily object-oriented language would be better? What's your input?
Just wondering about your thoughts about using C++ to design and implement a fractal operating system. How easily could C++ manage to inplement this? Perhaps a more heavily object-oriented language would be better? What's your input?
DiskJunky
What is a fractal operating system?
I've heard the phrase Fractal Encryption before, but that's only because of that Star Trek: First Contact (?) movie where Data does something to prevent the Borg from accessing some part of the Enterprise's Navigational Deflector or some such nonsense. Is that what you mean?
"Owners of dogs will have noticed that, if you provide them with food and water and shelter and affection, they will think you are god. Whereas owners of cats are compelled to realize that, if you provide them with food and water and shelter and affection, they draw the conclusion that they are gods."
-Christopher Hitchens
i dont know lol but i know what a fractal is just not how its related to an os...Originally posted by Shiro
What is a fractal operating system?
"fractal robot system" ?? I'm not sure how that means anything. As I remember, a fractal is an object whose Hausdorff dimension is different from its Lebesgue covering dimension, or topological dimension. IIRC, the lebesgue dimension is m for space T if for every open cover of T, there is a refining open cover that it less or equal to m+1, and the Hausdorff dimension of A, a subset of metric space R (a metric space is a space where there is a function f(x,y) that gives the distance between any two points x and y such that f(x,y)=f(y,x), f(x,x)=0, and the triangle inequality holds) is the infinum p>=0 such that the p-dimensional hausdorff measure of A is 0 (the hausdorff measure of A is the infinum of positive numbers x where for all postive r, A can be covered a finite group of closed sets, where each group has a diameter less than r, so that the sum of the first p powers of the diameters is less than x. Reading this, I really appreciate as never before the skill of math textbook writers. God, I wouldnt be able to explain multiplication.
I go to encounter for the millionth time the reality of experience and to forge in the smithy of my soul the uncreated conscience of my race.
Windows XP consists of 32 bit extensions and a graphical shell for a 16 bit patch to an 8 bit operating system originally coded for a 4 bit microprocessor, written by a 2 bit company, that can't stand 1 bit of competition.
I dunno about you guys, but Windows comes pretty close
BTW: Fyodor, love that sig...
DiskJunky, you should refine your question a little. (Otherwise you may get more responses such as Fyodors
Code:#include <cmath> #include <complex> bool euler_flip(bool value) { return std::pow ( std::complex<float>(std::exp(1.0)), std::complex<float>(0, 1) * std::complex<float>(std::atan(1.0) *(1 << (value + 2))) ).real() < 0; }
Sorry about that.
What Fydor's post was saying was that, there is one "node" that is defined a problem, and it self-propegates and passes a slightly refined sub-problem to each node it creates, which in turn do the same until answers start coming back (like recursive programming, but with the power of o-o).
Fractal robots are robots where each "mini" robot is completly self sufficient, but can combine with an "infinate" (potentially ) number of identical robots that could ultimatly perform any task. Picture this on the molecular level, and you get something like the liquid robot out of terminator 2.
Check search engines for "nanotechnology"
Fractal encryption... dunno, haven't come across that one. Possibly one mini-encryption algorithim capable of self propegation in a controled, but near-infinate way. The problem there is, how the hell do you decrypt it?
A fractal Operating system...
Well, the idea here is that you only program a single node. This node is capable of self-replicating into every part of the hardware to provide an interface. The node should also (possibly, this is just my interpretation of it), be able to identify themselves so that interrigating a particular node can bring up the appropiate information. The other moethod of bringing up the appropiate information would be to interrigate the master node (the starting one), and it would come back with the appropiate answer. Effictivly, this would be a universal os as long as the computer was capable of running the program. Potentially slow, but also very efficient in system management, and wouldn't actually crash (in theory).
Each node must be IDENTICAL to every other node
I hope this clarified a bit
DiskJunky