Epstein Secrets

h Turing thesis says that all univers=l computers can compute each other, and therefore have the same power. I suspect that it is possible that the Church Turing thesis is also a physi=al law, i.e. it is impossible to build physical computer that can calculat= more than a Turing machine. However, that conflic

t of =11 trajectories along which this information can flow, as seen from the pe=spective of an observer. We can get such an arrangement from a flat lattic= (i.e. a graph) that is approximately regular and fine grained enough. If =e disturb the lattice structure by adding more links, we get nonlocality (

h Turing thesis says that all univers=l computers can compute each other, and therefore have the same power. I suspect that it is possible that the Church Turing thesis is also a physi=al law, i.e. it is impossible to build physical computer that can calculat= more than a Turing machine. However, that conflic

t of =11 trajectories along which this information can flow, as seen from the pe=spective of an observer. We can get such an arrangement from a flat lattic= (i.e. a graph) that is approximately regular and fine grained enough. If =e disturb the lattice structure by adding more links, we get nonlocality (

h Turing thesis says that all univers=l computers can compute each other, and therefore have the same power. I suspect that it is possible that the Church Turing thesis is also a physi=al law, i.e. it is impossible to build physical computer that can calculat= more than a Turing machine. However, that conflic

t of =11 trajectories along which this information can flow, as seen from the pe=spective of an observer. We can get such an arrangement from a flat lattic= (i.e. a graph) that is approximately regular and fine grained enough. If =e disturb the lattice structure by adding more links, we get nonlocality (