#computational complexity theory

[brightgreendandelions]

hey everyone! look at my first lecture notes!! it's over a 100 lines long, for like a 1h30min lecture. math is fun, but very fast paced and exhausting

[forexbeginnersworld]

Profitable forex system proof for any platform $1,000.00End Date: Friday Feb-28-2020 13:03:38 PSTBuy It Now for only: $1,000.00Buy It Now | Add to watch list Source link

[gennarostuff]

The Speed-Reversibility Decision-Making Matrix

The Speed-Reversibility Decision-Making Matrix

The speed-reversibility framework is a simple matrix for decision-making to understand when to analyze scenarios before making decisions. And when moving extremely fast instead.

As you dive into the entrepreneurial world, you might struggle to make things work. And as that happens, you start looking for resources online to help you out throughout that process.

Chances are you’ll stumble on an…

View On WordPress

[forexbeginnersworld]

Why you need Proof of Work

Why you need Proof of Work

[ad_1]

Why you need Proof of Work

[ad_2] View Reddit by xentagz – View Supply

View On WordPress

[jonghong]

Computational complexity theory | Wikiwand

Computational complexity theory is a branch of the theory of computation in theoretical computer science that focuses on classifying computational problems according to their inherent difficulty, and relating those classes to each other. A computational problem is understood to be a task that is in principle amenable to being solved by a computer, which is equivalent to stating that the problem may be solved by mechanical application of mathematical steps, such as an algorithm.

[antialiasis]

This is pretty great. It’s an academic paper proving that determining whether a level or dungeon in several classic Nintendo games (Mario, Donkey Kong Country, The Legend of Zelda, Metroid and Pokémon) can in theory be finished is an NP-hard problem (that is, if you invented an efficient algorithm to do it, that would suffice to prove that P = NP and the world would be thrown into chaos). Additionally, for Donkey Kong Country and some Zelda games, they prove that the problem is PSPACE-complete.

Basically, in both cases, they show that certain problems known to be NP-complete and PSPACE-complete respectively can be modeled within these games, by breaking those problems into relatively simple components and then building each of those components within each game. My favorite part is when they establish that since block puzzles have already been proven to be NP-hard, that automatically makes Pokémon NP-hard, but because that’s really boring, they instead present an alternative proof where they construct all the necessary components using just walls and trainers.

[astrolou]

Who controls the world? - James B. Glattfelder - 17 min Ted Talk

Who controls the world? – James B. Glattfelder – YouTube.

15 May 2013

James Glattfelder studies complexity: how an interconnected system — say, a swarm of birds — is more than the sum of its parts. And complexity theory, it turns out, can reveal a lot…

View Post