Another pointess post by yours truly. -_-
Today I got a half day. It was the day of my science finals.
My thoughts: Close to a hell hole but not quite.
My opinion: Easy A. SO gonna Ace that final.
YOSH!! I think that science finals are the easiest.
Maybe cause it's my best subject. I dunno. But I found it pretty easy. My next Final is Math. Math in my opinion is second easiest. For homework, my teacher is making us look for any theorem that has been solved and how it was solved and write it down on our test if we want extra points. Hm...I was thinking of doing Fermat's Last Theorem but I don't feel like it. Probably do something easy like Savitch's Theorem. Here's the formula thingy.
any function f(n) ≥log(n) NSPACE(f(n)) ⊆ DSPACE(f²(n))
Simpler terms from wikipedia: In other words, if a nondeterministic Turing machine can solve a problem using f(n) space, an ordinary deterministic Turing machine can solve the same problem in the square of the space. Although it seems that nondeterminism may produce exponential gains in time, this theorem shows that it has a markedly more limited effect on space requirements.
Proof from wikipedia:
The proof of the theorem is constructive: it demonstrates an algorithm for STCON, the problem of determining whether there is a path between two vertices in a directed graph, which runs in log(n)2 space for n vertices. Then, it builds a DSPACE machine which runs the algorithm on the computation tree of the corresponding NSPACE machine to determine whether there is a path from the start node to the accept node, and accepts if and only if this is so. As STCON is NL-complete, this demonstrates that all languages in NL are also in L2.
I don't feel like doing the Pythagorian theorem though. Even though there's multiple proofs of it being solved and all, I might confuse one of em up for the other. If you wanna suggest to me any theorem just leave it as a comment. Okay uh...next page to Joker is in progress. But not gonna be submitted yet until next week. kk now. Gotta go. Jaa ne!