because Idc if I make sense or not ?
hmm well I suppose some stuff about myself is predictable
You're actually pretty consistent, you don't even seem to get bored of repeating yourself.
there is probably some higher perspective that I am not seeing rn that is another reason why sometimes what I say does not make sense because it is not integrated (happens when you see life from billions of different perspectives idk why I do this but I have always done it I never know what perspective I am going to be seeing life from)
If that's true, then why is your advice to others always a projection of your own needs?
You're very singular, arguably solipsist. You don't even seem to have empathy or sympathy.
maybe she's a charity fundraiser running in circles for a good cause
She'd need to be more social if she planned to do much more than food kitchen work.
chaos = unpredictability and men are attracted to this as well whether they will confess to it or not most men become bored very easily with routine
my personality is unpredictable no matter what everything about me is unpredictable and chaotic and men find that thrilling
to be totally fair I cannot even predict myself lmao ;p
Chaos is typically not considered unpredictability, though some properties of chaotic systems can be considered unpredictable.
By definition, in the convention Chaos Theory and Nonlinear Dynamics, all chaotic systems are deterministic given they are systems with bounded state spaces. As such you know they will never exhibit behavior outside the bounds of those states, and therefore you can actually predict much of their behavior.
In relation to what you're saying, does this mean your new identity is the Queen of Chaos or something? Will your new replacement for christianity be anarchism? This is clever given we've witnessed multiple cycles of your behavior each with different claims to divine entities, it's plot twist consistent with the story that we've been dealing with the God of Chaos this whole time.
Is "undecidable" as close to unpredictable as it gets in math/computation?
The interesting venture of recursive thinking: trying to consider what you might think next relates to context in any situation, but really you can only think what you think when you think it. How close to the Halting Problem does that get us?
Chaos is typically not considered unpredictability, though some properties of chaotic systems can be considered unpredictable.
By definition, in the convention Chaos Theory and Nonlinear Dynamics, all chaotic systems are deterministic given they are systems with bounded state spaces. As such you know they will never exhibit behavior outside the bounds of those states, and therefore you can actually predict much of their behavior.
Is "undecidable" as close to unpredictable as it gets in math/computation?
The interesting venture of recursive thinking: trying to consider what you might think next relates to context in any situation, but really you can only think what you think when you think it. How close to the Halting Problem does that get us?
I would say it probably depends on context but its not a horrible way of describing it in my opinion.
In higher order mathematics, that is the mathematics one would use to talk about physical systems or situations, a system is considered predictable because it satisfies existence and uniqueness theorems of which there are several. This also relates to systems that are probabilistic or nonlinear.
Essentially, regardless of the kind of system we are going to use Differential Equations to describe it and its evolution. For physical systems in physics you use partial differential equations and ordinary differential equations. For probabilistic systems you use stochastic differential equations. Systems to be described by differential equations are classified in mathematics as Initial Value Problems, that is because we derive the equations that describe the systems in question via these initial values.
Whether or not a system is considered deterministic depends on if the Initial Value Problem satisfies the previously mentioned existence and uniqueness theorems. The existence theorem establishes whether or not a set of equations exist to describe the system, a long with whether or not there are solutions to those equations. There are some systems, typically in nonlinear dynamics, where finding a set of equations to describe the system is impossible. In other systems where there are both equations and solutions, there may be infinite solutions, and if something predicts everything its predicts nothing.
Predictability of random systems follows the same rules. A random systems that is predictable is governed by a stochastic (random) process whose next value can be predicted, that is it has a set of stochastic differential equations with solutions for the next n+1 event. Every deterministic process, including those that we typically don't model stochasticly also meets this condition. Of course for something to not be predictable by this condition we cannot produce a bounded solution for the next n+1 event.
So in mathematics typically something is unpredictable if it cannot be modeled (has no equations to describe it), has no solutions, or its solutions are unbounded.
Undecidable is functional in describing the status of not being able to model a system, or produce equations to describe it, given this is often an issue of complexity. In the case in which solutions do not exist or are unbounded, it may be inappropriate to call these undecidable because we can conclude a a priori by mathematical proof that the equations that describe a system in fact have no solutions or have unbounded solutions. You can fall back on the argument that perhaps there are no bounded solutions because of complexity, but there are plenty examples of very simple systems, so simple that they are linear, that provably have no solutions.
In computer science and mathematical logic the problem is the opposite. It may be inappropriate to describe something that is undecidable as unpredictable because the set of solutions can be known and bounded while remaining undecidable. In fact theorems of uniqueness and existence, as they apply to initial value problems, do not apply to computational or mathematical logic problems because they are fundamentally a different kind of problem. I will say they are analogues, one being for numerical systems that evolve via rates of change while the other are logical/propositional.
"Neurotics make great sex partners"
She's a coprophiliac.