On Sunday, March 25, 2018 at 5:01:59 AM UTC-6, Bruno Marchal wrote: > > > Yes, and if someone argue that consciousness is not maintained whatever > the substitution level is, it is up to them to explain what in the > brain+local-evirnoment is not Turing emulable. I see only the “wave packet > reduction”, but I don’t see any evidence for that reduction, and it would > make Quantum mechanics inconsistent (I think) and not usable in cosmology, > nor in quantum information science. To believe that the brain is not a > “natural” machine is a bit like believing in some magic. Why not, but where > are the evidences? > > > Bruno >
There are a couple of things running around here. One involves brains and minds and the other wave function reduction. The issue of up loading brains or mapping them come into the problem with the NP-complete problem of partitioning graphs. I like to think of this according to tensor spaces of states, such as with MERA (multi-scale entanglement renormalization ansatz) tensor networks. The AdS_3 example with H^2 spatial surface is seen in the diagram below. <https://lh3.googleusercontent.com/-KTQRkq19A5k/Wre62NN61yI/AAAAAAAADTI/tYG0j0LYGBsd1SKZ38rnFaAFxj5PaOhrwCLcBGAs/s1600/MERA-AdS%2Btensor%2Bnetwork.jpg> This network has the highest complexity for the pentagonal tessellation for these are honeycombs of the groups H3, H4, H5 corresponding to the pentagon, dodecahedron, and the 4-dim icosadedron or 120/600 cells. These groups will tessellate a 2, 3 and 4 dimensional spatial hyperbolic surface embedded in AdS_3, AdS_4 and AdS_5. These define half the weights of the E8 groups with the Zamolodchikov eigenvalues or masses. 5-fold structures have connections to the golden mean, and the Zamolodchikov quaternions are representations of the golden mean quaternions. A quantum error correction code (QECC) defines a projector onto each of these partitioned elements, but (without going into some deep mathematics) this is not computable in a root system because there is no Galois field extension, which gives that the QECC is not NP-complete. This of course is work I am doing with respect to the problem of unitarity in quantum black holes and holography. It may have some connection with more ordinary quantum mechanics and measurement. The action of a measurement is a process whereby a set of quantum states code some other set of quantum states, where usually the number of the measuring states is far larger than the measured states. The quantum measurement problem may have some connection to the above, and further it has some qualitative similarity to self-reference. This may then mean the proposition P = NP or P =/= NP is not provable, but where maybe specific examples of NP/NP-complete algorithms as not-P can be proven. This further might connect with the whole idea of up-loading minds into computers. Brains and their states are not just localized states but networks, and it could well be that this is not tractable. I paste in below a review paper on graph partitioning. This is just one possible theoretical obstruction, and if you plan on actually "bending metal" on this the problems will doubtless multiply like bunnies in spring. As a general rule once these threads gets past 100 I tend not to post any more. It becomes to annoying to find my way around them. LC https://arxiv.org/abs/1311.3144 Recent Advances in Graph Partitioning Aydin Buluc <https://arxiv.org/find/cs/1/au:+Buluc_A/0/1/0/all/0/1>, Henning Meyerhenke <https://arxiv.org/find/cs/1/au:+Meyerhenke_H/0/1/0/all/0/1>, Ilya Safro <https://arxiv.org/find/cs/1/au:+Safro_I/0/1/0/all/0/1>, Peter Sanders <https://arxiv.org/find/cs/1/au:+Sanders_P/0/1/0/all/0/1>, Christian Schulz <https://arxiv.org/find/cs/1/au:+Schulz_C/0/1/0/all/0/1> (Submitted on 13 Nov 2013 (v1 <https://arxiv.org/abs/1311.3144v1>), last revised 3 Feb 2015 (this version, v3)) We survey recent trends in practical algorithms for balanced graph partitioning together with applications and future research directions. Subjects: Data Structures and Algorithms (cs.DS); Distributed, Parallel, and Cluster Computing (cs.DC); Combinatorics (math.CO) Cite as: arXiv:1311.3144 <https://arxiv.org/abs/1311.3144> [cs.DS] (or arXiv:1311.3144v3 <https://arxiv.org/abs/1311.3144v3> [cs.DS] for this version) -- You received this message because you are subscribed to the Google Groups "Everything List" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at https://groups.google.com/group/everything-list. For more options, visit https://groups.google.com/d/optout.
