无限机器编程
Programming infinite machines
摘要:
对于无限的机器是免费的经典汤普森的灯悖论,我们表明,他们不是免费的,从它的倒置版本。我们提供了一个程序,无限的机器和一个无限的机制,模拟这个悖论。虽然它们的有限类似物可以预测地工作,但程序和无限机制表现出未定义的行为。正如在无限戴维斯机器的情况下,我们的例子是免费的无限质量,无限速度,无限的力量,等等,只有无限的整除空间和时间是假设。因此,所考虑的无限装置在连续牛顿宇宙中是可能的,并且它们与连续牛顿力学不冲突。一些可能的应用分析的Navier-Stokes方程进行了讨论。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。