My Math Forum NPComplete - Superfluidity and if accurate Navier Stokes

 Applied Math Applied Math Forum

 August 23rd, 2013, 09:57 AM #1 Senior Member   Joined: Jan 2013 Posts: 209 Thanks: 3 NPComplete - Superfluidity and if accurate Navier Stokes See the waves... https://www.youtube.com/watch?v=vOFcHqImXJ8 Having a very practical need to simulate superfluidity or close to it, in the way brains think in loops so each part of the brain keeps getting feedback about any idea going out, all possible loops of connected neurons would do it, but when you can't try every combination, you have only superfluidity left to make sure the incoming and outgoing flow of information (seen as arrows between neurons or pixels or words) is equal even when the network of possible paths is too confusing and big to navigate and know if there even is a way back other than the way you left. Exactly simulating superfluidity through the NPComplete problem http://en.wikipedia.org/wiki/Hamiltonian_path will be completely still through at least 1 node if no such path exists. Otherwise it must branch or merge somewhere like a simple loop of nodes except replace 1 edge with 2 more nodes and 4 edges where that edge was removed, to the 2 nodes. You may rotate within the 4 nodes while the other nodes are still, but any other move is not unitary at those 3 way splits. It will find other paths too, using less nodes, and I also want it for that. Also, I think this is true http://en.wikipedia.org/wiki/Superfluid_vacuum_theory Its also useful for the immediate detection of a hacker anywhere in the global peer to peer network (in certain ways of running it, when you don't want to allow private spaces and disagreements of the multiverse of ways the shared space could be), unless they can hack the system without making a single wave by changing a bit which echos in many directions all through the network. This is why I like decentralized/peer, not because of file sharing. Theres no bottlenecks or central structures to complicate things. A subtle point of hacker detection... You can see if your connections to other computers are violating conservation of momentum through their simulated pipes (network routing of brainwaves), but for the same reason it tells you there exist paths without locally telling you the paths, we can know there is a hacker without knowing where or what they hacked. Anyone who remains in the network while it contains a hacker should be disconnected. True to Heisenberg uncertainty, unless P equals NP, you can verify conservation of momentum in the network only while you don't exactly know the position of the simulated flows, since you'd have to bring the whole flow to a halt to have time to count it and harder is you have to find a substitute for superfluidity to tell you about all paths in the system. If everyone takes the time to agree on all the positions in the network, then we have no way to know this is still true since it has stopped flowing to/from us.

 Tags accurate, navier, npcomplete, stokes, superfluidity

 Thread Tools Display Modes Linear Mode

 Similar Threads Thread Thread Starter Forum Replies Last Post BenFRayfield Number Theory 0 January 22nd, 2014 03:11 PM Mathematikmann Physics 0 December 28th, 2013 01:58 PM BenFRayfield Computer Science 3 August 25th, 2013 07:07 AM CherryPi Number Theory 7 January 6th, 2012 06:46 PM args0 Applied Math 2 February 9th, 2011 03:47 PM

 Contact - Home - Forums - Cryptocurrency Forum - Top