I have information that will lead to the arrest of Terence Tao @siliconaddict - Tumblr Blog

i hope i can nerd snipe you idiots with this

•18+ Adults Only

Watch Anya Live on Cam

Anya is live and ready to show you everything. Watch her strip, dance, and perform exclusive shows just for you. Interact in real-time and make your fantasies come true.

✓ Live Streaming✓ Interactive Chat✓ Private Shows✓ HD Quality✓ Free Actions

Free to watch • No registration required • HD streaming

#mathblr #math #mathematics

#mathblr #lalalala #high iq

letsfooleveryone

oneheadtoanother

•18+ Adults Only

Watch Anya Live on Cam

Anya is live and ready to show you everything. Watch her strip, dance, and perform exclusive shows just for you. Interact in real-time and make your fantasies come true.

✓ Live Streaming✓ Interactive Chat✓ Private Shows✓ HD Quality✓ Free Actions

Free to watch • No registration required • HD streaming

By Avogado6

My very first tiger drawing and my latest

goldensunset

when the characters never really make peace with it

•18+ Adults Only

Watch Anya Live on Cam

Anya is live and ready to show you everything. Watch her strip, dance, and perform exclusive shows just for you. Interact in real-time and make your fantasies come true.

✓ Live Streaming✓ Interactive Chat✓ Private Shows✓ HD Quality✓ Free Actions

Free to watch • No registration required • HD streaming

bobbole

Moebius, Le fil d'Ariane

everyday-cutephoto

escuerzoresucitado

straycatj

家主おきるです

オレのたんぶらも　おきるです

Hey, get up landlady, and get my tumblr up

It's crazy, just how far we're from proving P ≠ NP. It is known that LOGSPACE ⊆ NLOGSPACE ⊆ P ⊆ NP, but so far we haven't even managed to rule out LOGSPACE = NP, even though the former is something logarithmic and the latter is (by current knowledge) something exponential.

By the way, in the above inclusions only NLOGSPACE ⊆ P is nontrivial but easy to prove: Any NLOGSPACE Turing machine (NL-TM) that has S states and uses ≤ k × log n memory has S × 2^(k × log n) = S × nᵏ many configurations. A P-TM can list all those configurations and simulate the NL-TM's computation paths by running, say, breadth-first search on the start configuration. The P-TM then accepts iff it reaches any of the NL-TM's accepting configurations. Since breadth-first search takes O((S × nᵏ)²) = O(n²ᵏ) time, any NLOGSPACE problem can indeed be solved in polynomial time.

#math #computer science

•18+ Adults Only

Watch Anya Live on Cam

Anya is live and ready to show you everything. Watch her strip, dance, and perform exclusive shows just for you. Interact in real-time and make your fantasies come true.

✓ Live Streaming✓ Interactive Chat✓ Private Shows✓ HD Quality✓ Free Actions

Free to watch • No registration required • HD streaming

jibunbosh

idiot at wizard school just said "i have devised the perfect mana nullification field rendering me impervious to all forms of magic!" i figure he should've taken a few more interdisciplinary courses because i tweaked the timing on a gravitation spell to throw a giant boulder at him. the moment I released the spell it stopped being a sorcery equation and started being a physics one

worldscoolest

Trending Blogs

Last Seen Blogs

I have information that will lead to the arrest of Terence Tao