N-Puzzle thoughts

Some n-puzzle ideas: Create an n-dimensional n-puzzle.  This is different from a rubiks cube because it is a sliding puzzle not a sequential move puzzle.  It is sort of like the last puzzle here called the Inside out puzzle by Vadász Kocka, it is of course only 3D not nD. Figure out how to reduce nD n-puzzle… Continue reading N-Puzzle thoughts

Published
Categorized as CS Theory

Decision Theory Paradoxes

I’ve been researching decision theory paradoxes because in my Bounty’s task allocation system I am considering the benefits of giving the bondsman the decision to allocate particular tasks through an auction (ie exclusive) or through its normal bounty (non-exclusive) method.  This brings with it a potentially multi-criteria decision which has me interested about the theoretical ramifications… Continue reading Decision Theory Paradoxes

AI conspiracy

I know this sounds all conspiracy theory like, but it seems possible that people like Bill Gates and Elon Musk, who have recently made comments about the potential threat of an artificial intelligence take over, were only doing it so that there would be more articles written about AI and how its highly unlikely given… Continue reading AI conspiracy

N-Queens

n-queens problem is a very interesting problem.  Especially when you start imagining more than 2 dimensions and start thinking d-dimensions it becomes an even more interesting and challenging combinatorics problem.  The link also points to some applications including traffic control, which makes sense.

QRE

Quantile Response Equilibrium http://en.wikipedia.org/wiki/Quantal_response_equilibrium a definition of equilibrium when the agents have bounded rationality.  I think that this has been the equilibrium definition that I have been looking for.

Published
Categorized as CS Theory

Entangled FindSet

Would be cool to use quantum entanglement to do instant FindSets (seeing if two elements are contained in the same set) for Kruskal MST algorithm. Say each vertex is a photon.  Whenever you do a union you entangle the photons.  Then all you have to do to compare if the photons belong to the same… Continue reading Entangled FindSet

Theoretical aspects roads

So, abstractly what is a road.  It is a queue for vehicles.  Intersections allow elements (vehicles) to change queues.  In this thought experiment I will abstract away lanes to just increased bandwidth and a corresponding increased throughput.  Essentially, the idea with dynamically changing road systems is two fold: one, we want the transitions between queues… Continue reading Theoretical aspects roads

Voting and Auction based Monitors

Condition variables and monitors go hand in hand.  There are various monitor protocols: Signal-and-Continue (SC), Signal-and-Urgent-Wait (SU), Signal-and-Exit, Urgent-Signal-and-Continue etc.  Basically these protocols define what order threads get to enter, reenter, and exit methods in a monitor.  They are defined by a first-come first-served (FCFS) queuing schemes to ensure their specific protocols are met. I… Continue reading Voting and Auction based Monitors

Ramsey Theory

Ramsey Theory address problems that ask the question “how many elements of some structure must there be to guarantee that a particular property will hold?”  This is the question that I want to know for brokers.  How many brokers must there be for no price wars to occur. Very interesting ideas.  I liked the one… Continue reading Ramsey Theory

Published
Categorized as CS Theory