Randomness lacks meaning; by definition. The application of meaning to randomness causes meaningful manifestations to occur naturally. Since the last time I checked it was two humans using human abstractions in order to provide an accurate description of the natural world my terminology is in fact quite sensible in the correct context.
Looking to something as a cause for meaning is quite moot - you are not thinking abstractly enough. Meaning is a machine.
It sounded quite mystical from over here. Ah, well, OK, I guess I can hang with that definition of meaning- I don't necessarily agree with it, it's what I call "order," but I understand what you mean.
Physics is the constant set of rules I refer to here. Physics dictates the rules by which machines can be built. Physics dictates the rules by which the machines may win or lose. This is not random and as such it is not random what machines will occur and in what settings they can win - all designs are not equal. If all designs were equal the choice of winning design would be arbitrary and therefore random.
Well, sure, but that's not the only, or even the most likely, definition of random in this setting, IMO. The constraints in operation in this system are far more stringent than the laws of physics.
By constantly invoking random events you are missing the point significantly - namely that the occurrence of an asteroid or climate change does not change how machines can be built nor which environments in which such a machine could win. What machines occur is still not by any means arbitrary - it is always based on the meaning imposed on the random changes (i.e. mutation) by physics.
I don't get what you're saying here, nor how it relates to what I'm saying. What you appear to be saying is either, ducks don't lay eggs that hatch mice, or that the ducklings that hatch don't have four wings. Since that's trivially obvious, and well within my assumptions for how evolution works, I can only assume that you have something else in mind.
I cannot fathom why, "dynamic system," means, "random," to you. If I implemented a dynamic packet routing algorithm I doubt you'd call the results "random," even though the nature of the inputs to the algorithm are highly subject to chaotic behaviour.
I don't see this analogy as having much to do with how fitness landscapes change. To mangle the analogy, a fitness landscape change is as if wires suddenly no longer worked and you had to use optical fiber. At that point, your router is a very expensive doorstop. Hopefully one of the variations its offspring (another manner in which this analogy fails) have is optical ports.
Yet again I am going to have to ask just how on Earth the existence of ring species affects anything I've said here because I am just not seeing it at all.
The existence of ring species questions whether the order that most people believe they see, the order of the separation of organisms into species, exists in the real world. If you had some other sort of order in mind, you should say what that order is at this point.
****, it's like you aren't even listening to me when I tell you that I agree.
Perhaps you might look your statement over a bit more carefully and note that I wasn't responding to that part of it.
Messy != random. That's an equivocation fallacy.
And that's a straw man. I never said it did.
Well, they do I'm afraid. Hell, you can go right ahead and think you don't but the whole reason why we can see patterns in groups is because the underlying behavioural patterns are being exposed.
There's no magic that separates what causes "individual behaviour," from "group behaviour," it's just really noticeable when group behaviour does arise.
You seem to see individual behavior as far more programmed than I do. Individuals may take it into their heads to do many things that are not driven by underlying behavioral patterns, when driven by exigencies. And even when not. If only one individual chooses to do that particular thing, it's hard to see how that's not separate from group behavior, since upon analysis it will be outside the normal range, merely adding "noise" to the analysis of the things that all of the individuals of that species do. It's a data point that will be thrown out upon statistical analysis.
Yet again I fail to see how that affects my argument at all. I still don't get why, for you, determined must mean, "unchanging in all contexts."
Because you keep saying selection is not random, and maintaining that this proves that evolution is not random, and implying the corollary that if selection were random, evolution would have to be too. If selection criteria cannot be shown to be stable, then selection can hardly be said to be non-random. But this does not affect whether evolution is orderly or not; it just means that order arises from chaos. I have quite deliberately never stated that evolution is random; that's not what I'm saying at all. What I'm saying is, it's not non-random. I don't think either class fits it well.
Evolution is an algorithm that does not care for end products - it just runs and organisms are just the internal working for a computation that has no goal.
Selection is an algorithm that does not care for end products-
evolution is
about the end products. To put this another way, selection is an algorithm whose parameters are constantly changing; and you're right, such an algorithm cares nothing for its end products, it merely produces them.
Evolution, however, is a statement about the character of the end products that have been through this algorithm, and being made up of those end products, can hardly be said not to "care" about them. Selection could, in other words, just operate until all the organisms are gone. But there would be no evolution if that happened.
****, it's not like I haven't pointed that out since the beginning - what you guys seem to be so resistant to is the idea that equal genetics does not mean equally strength players because the nature of the game precludes that. It is inherently unfair.
And for the record I must state, once again:
Unfair != random. That's an equivocation fallacy.
And what you seem so resistant to is the idea that no one is saying that the players are of equal strength; merely that
even if they were, selection would not operate non-randomly, if "selection" means whether they breed or not. As it is, there is no guarantee,
at the individual level, that a "fitter" organism, by the standards of fitness that apply to its species, will procreate, or that a "less fit" organism, by those same standards, will not. It is only in the aggregate that these become close enough to true that selection drives the evolution of new adaptations.
It's also a straw man to state that unfair != random, I never said it did.
****, I wonder which process I could possibly analogise to this?
Try real physics. Or real biology. This is the sort of algorithm that creates mountains, or that organisms use to construct themselves.
Except to construct an oracle - that's always possible.
How? In this case, as far as we know, there is no way to construct an oracle more effective at this type of problem than the computer itself- and we cannot predict the computer's time to find a solution. I think this might be what I was getting at above when I said you can't make a shortcut for this algorithm.
If it's time that is important than either one can use a more complicated algorithm for a time optimal result or one cannot. Either way no matter what one is talking about, you can't calculate without, er, actually calculating.
That's not the point. The point is, there is no shortcut algorithm for such a calculation, and the calculation is not guaranteed to end after a known number of iterations.
It isn't essentially random. To say it is essentially random would be to say that the time it would take is arbitrary. If that were the case then performing the same calculation about the same point would take a different amount of time each time the algorithm were run. Now I am not familiar with this problem but I'm going to have to assume that is not the case.
You're correct, it's not- but your definition of "essentially random" is far different from mine, so in that respect, since you're commenting on my analogy, this is aside from the point.
That's all very well and good but as you should very well know there is no proposed super-TM that can exist that has been shown to actually provide the ability to compute something a TM cannot.
Ummm, ever hear of Persistent Turing Machines, or interaction theory? No? This is the basis upon which OOP was created. TMs cannot do OOP. They do not interact. You might want to check
this out. Interaction implies Godel incompleteness, and that in turn provides the basis of more complex operations that a standard TM is not capable of. Here are some quotes from a related paper by Wegner:
"Interaction machines, defined by extending Turing machines with input actions (read statements), are shown to be more expressive than computable functions, providing a counterexample to the hypothesis of Church and Turing that the intuitive notion of computation corresponds to formal computability by Turing machines. The negative result that interaction cannot be modeled by algorithms leads to positive principles of interactive modeling by interface constraints that support partial descriptions of interactive systems whose complete behavior is inherently unspecifiable. The unspecifiability of complete behavior for interactive systems is a computational analog of Gödel incompleteness for the integers.
Incompleteness is a key to expressing richer behavior shared by empirical models of physics and the natural sciences. Interaction machines have the behavioral power of empirical systems, providing a precise characterization of empirical computer science. They also provide a precise framework for object-based software engineering and agent-oriented AI models that is more expressive than algorithmic models."
Wegner directly states the underpinnings of what I am getting at (and what the paper I previously referenced says explicitly): evolution is not computable. By the way, you might want to take a look at some of his other work; I suspect you'll find
this interesting. Wegner states that it is a myth that the Church-Turing Thesis says that there is no more expressive model of computation than the TM. And proves it, at least to my satisfaction.
Now, Wegner changes the definition of "computable;" but you were not talking about this changed definition, you were talking about the original definition, "computable on a TM." And evolution is not. It is, however, computable on a PTM.
Non-determinism only allows for computation time to be reduced for certain classes of computation. It provides no more power whatsoever.
So in other words Evolution is computable since it is entirely possible to provide a deterministic ordering that will simply evaluate every possibility.
I think you need to study the above a bit more. I also think you need to take a hard look at what "computable" means. Don't try shifting the goalposts to the PTM, either; your original contention is, and will remain, "computable on a TM," not "computable on a PTM."
No, I am speaking of meaning because I am using a computational argument. To a machine the meaning of its inputs is simply the change of state that it causes. To you and I the meaning of this words is simply whatever particular associations we have learnt for them that get triggered by our interpretation of these symbols. I use the word meaning because randomness is devoid of meaning.
You are trying to stuff infinite precision real numbers into a TM. It doesn't work that way. The action table and state register are finite. It will take infinite time to enter a single infinite precision real number into a finite machine. Never mind computation, you'll never finish the first input.
Well the real problem is that true randomness is indistinguishable from an infinite machine that could exist that could produce the output. Now whether or not true randomness exists or not is neither hear nor there - the point is that we implicitly understand meaning as deriving from machine-like processes; rules, causality, order.
Now, that I'll partly go along with; however, the real world does not necessarily conform to our understanding in that regard. Again, these are classifications we apply to messy real-world phenomena; when you're talking about particle physics, you get some of the most well-defined order we have found, but at the expense of sharply definable causality. Some particle actions are acausal. When you apply it to biology, you are in yet another completely different game. At the scale of genes,
2LOT does not apply. That is a consequence of the fluctuation theorem.
Now the important part of evolution, the part that shapes the output, is not the random changes in the design of the machine, nor the random appearance of the environment, it is how the machine succeeds in whatever environment it happens to be lucky or unlucky enough to find itself in.
Precisely! That's what I've been saying the entire time. Evolution is
orderly; that does not mean it is
non-random. Nor does the statement that it is not non-random necessarily imply the statement that it is random. It is neither. It is orderly. But if you push too far down into what "orderly" means, in this case you will encounter randomness. Do you see now why I used fractals, and conceptually invoked dynamical systems theory? Is a fractal orderly? Of course it is. Is a fractal random, or non-random? No. Here is an apparently simple function that may run completely out of control. Or it may not. You won't know just by looking at it; you have to compute it, and you may not be able to complete the computation on a finite machine.
You can't know in advance whether you will or not. Period three implies chaos. (Yes, that was a reference to the famous paper of that title.)
That is why natural selection is not random. That is why evolution is not random. Meaning is imposed by the nature of reality.
No. Meaning is NOT imposed by the nature of reality. Please read what I have said and linked to carefully.