2018/02/06 by Anton Kutsenko, Kutsenko, Anton
Computer Science · Physics and Astronomy · #FOS: Computer and information sciences #FOS: Physical sciences #Logic in Computer Science (cs.LO) #Quantum Physics (quant-ph) #cs.LO #quant-ph
paper · pdf · doi:10.48550/arxiv.1802.01910
This is a preliminary version, some statements are not strict and are subject to discussion
arxiv created 2018/02/06 · arxiv updated 2018/02/07
For infinite machines which are free from the classical Thompson's lamp paradox we show that they are not free from its inverted version. We provide a program for infinite machines and an infinite mechanism which simulate this paradox. While their finite analogs work predictably, the program and the infinite mechanism demonstrate an undefined behavior. As in the case of infinite Davies's machines, our examples are free from infinite masses, infinite velocities, infinite forces, etc. Only infinite divisibility of space and timeis assumed. Thus, the considered infinite devices are possible in a continuous Newtonian Universe and they do not conflict with continuous Newtonian mechanics. Some possible applications to the analysis of the Navier-Stokes equations are discussed.