> In a paper written by Marlow Anderson and Todd Feil, linear algebra is used to prove that not all configurations [of Lights Out] are solvable and also to prove that there are exactly four winning scenarios, not including redundant moves, for any solvable 5×5 problem.
Say we have hyperbolic surface, and simple closed curves $a,b$ and $\bar a, \bar b$ and the pairs are in minimal position, with $a,\bar a$ homotopic, and $b, \bar b$ homotopic. I really think there should be homotopies $F,G$ which if ran at the same time take $a$ to $\bar a$, $b$ to $\bar b$, and $a_t=F(,t),b_t=G(,t)$ are in minimal position the whole way. I am having a hard time justifying this though. It feels obvious in the universal cover, but I haven’t proved it.
Constant negative curvature. Minimal position for curves is when we have that out of homotopic representatives for those curves they have the fewest number of intersections. This is equivalent to the curves being transverse and having no bigons @AkivaWeinberger
Yah, I don't really care about the metric, I just care about the topology at the moment, and maybe the geometry would make this easier to prove, so I figured I would mention it.
I know some algebraic topology (from reading the first two chapters of Hatcher), so I know what homotopies and universal covers are, but Hatcher doesn't cover anything about minimal position.
I don't think he does. Basically I want to show some construction is independent of the homotopic representatives I choose, and this minimal position business is part of the construction.
@AkivaWeinberger random question. What would be the best way to define an alternate version of the derivatives. Examples, axiomatic identities, or what?
@Kane It is incorrect; if $a$ and $b$ are both positive and $a\le b$, then $\frac1a\color{Red}{\ge}\frac1b$.
The inequality flips.
More generally, if they're the same sign the inequality flips, and if they're opposite signs (one positive, one negative), the inequality stays the same.
@TheGreatDuck To see how the definition of derivative I just gave works
It's also cool seeing how the product rule comes so easily from it
I guess you'd need to specify that $\epsilon>0$ for the step functions to be defined, but yeah, the definition would work, and it would be undefined at the discontinuous points @TheGreatDuck
In mathematics, a weak derivative is a generalization of the concept of the derivative of a function (strong derivative) for functions not assumed differentiable, but only integrable, i.e. to lie in the Lp space
L
1
(
[
a
,
b
]
)
{\displaystyle \mathrm {L} ^{1}([a,b])}
. See distributions for an even more general definition.
== Definition ==
Let
u
{\displaystyle u}
be a function...
@TheGreatDuck Notice that, in their weak derivative of $|x|$, the value at $x=0$ is unimportant; any function that differs from it at just one point is also a weak derivative
More generally, any function that differs from it at a null set is also a weak derivative
The head can be in one of several "states" (the amount depends on the Turing machine), and it can write one of several "symbols" on the cells (again, depends on the Turing machine)
Depending on the state of the head and the symbol in the square, it will either erase the symbol, replace it with a new one, or do nothing; it will change state; and it will move either one cell to the right or one cell to the left
@TheGreatDuck I apologize, I wasn't trying to talk down or anything
The diagram on the left essentially shows the tape progressing through time as you go down. It's starting with a blank tape, but you could start it with things on the tape already.
Turing was the one who first showed that universal Turing machines exist. This means that you don't need to build one machine to multiply numbers for you, another machine to calculate digits of pi, another machine to play Tic-Tac-Toe, etc
You just need to build the universal Turing machine
@Socrates "we" is the proper pronoun because the idea is that in a proof both you and the reader are essentially working through it together. Of course, you did all the true work. They just have to read it and understand. :D
@AkivaWeinberger I know the CS teacher once made a random remark about dna being a von neumann architecture complete with an identifiable heap space, function space and yadda yadda yadda
and it's just an explanation as to why something is true
@AkivaWeinberger fair enough, but dna is an example of not only a universal computer, but one coincidentally using the von neumann architecture. Chew on that.
we just don't know the meaning of everything in it obviously
but that's no different than people unable to decompile some random program
It means cells have a lot of the same stuff regardless of the species @Socrates. All cells have mitochondria that work essentially the same way, plus DNA replication, ribosomes, etc. All are the same mechanism from organism to organism.
Monocercomonoides is a genus of flagellate Excavata belonging to the order Oxymonadida. Monocercomonoides species have been discovered living in the guts of small mammals, snakes, and insects. The genome of Monocercomonoides has approximately 75 million base pairs (75 Mbp), with 16629 predicted protein-coding genes.
Many excavates lack "classical" mitochondria. Oxymonads lack true mitochondria and Golgi apparatus. Monocercomonoides has been characterized as the first example of a eukaryotic organism devoid of mitochondria. Its genome contains no mitochondrial DNA (mtDNA), and no genes for cardiolipin...
@KajHansen plus in terms of memory within dna (there are portions that change like as in a program) they all have the same core components and structure like how computer programs are all very similar in architecture.