ﻻ يوجد ملخص باللغة العربية
We formulate a property $P$ on a class of relations on the natural numbers, and formulate a general theorem on $P$, from which we get as corollaries the insolvability of Hilberts tenth problem, Godels incompleteness theorem, and Turings halting problem. By slightly strengthening the property $P$, we get Tarskis definability theorem, namely that truth is not first order definable. The property $P$ together with a Cantors diagonalization process emphasizes that all the above theorems are a variation on a theme, that of self reference and diagonalization combined. We relate our results to self referential paradoxes, including a formalisation of the Liar paradox, and fixed point theorems. We also discuss the property $P$ for arbitrary rings. We give a survey on Hilberts tenth problem for quadratic rings and for the rationals pointing the way to ongoing research in main stream mathematics involving recursion theory, definability in model theory, algebraic geometry and number theory.
We relate the decidability problem for BS with unordered cartesian product with Hilberts Tenth problem and prove that BS with unordered cartesian product is NP-complete.
The synchronization process of two mutually delayed coupled deterministic chaotic maps is demonstrated both analytically and numerically. The synchronization is preserved when the mutually transmitted signal is concealed by two commutative private fi
The halting problem is undecidable --- but can it be solved for most inputs? This natural question was considered in a number of papers, in different settings. We revisit their results and show that most of them can be easily proven in a natural fram
In this paper we reduce the generalized Hilberts third problem about Dehn invariants and scissors congruence classes to the injectivity of certain Chern--Simons invariants. We also establish a version of a conjecture of Goncharov relating scissors co