Computable Diagonalizations and Turing’s Cardinality Paradox

A. N. Turing’s 1936 concept of computability, computing machines, and computable binary digital sequences, is subject to Turing’s Cardinality Paradox. The paradox conjoins two opposed but comparably powerful lines of argument, supporting the propositions that the cardinality of dedicated Turing machines outputting all and only the computable binary digital sequences can only be denumerable, and yet must also be nondenumerable. Turing’s objections to a similar kind of diagonalization are answered, and the implications of the paradox for the concept of a Turing machine, computability, computable sequences, and Turing’s effort to prove the unsolvability of the Entscheidungsproblem, are explained in light of the paradox. A solution to Turing’s Cardinality Paradox is proposed, positing a higher geometrical dimensionality of machine symbol-editing information processing and storage media than is available to canonical Turing machine tapes. The suggestion is to add volume to Turing’s discrete two-dimensional machine tape squares, considering them instead as similarly ideally connected massive three-dimensional machine information cells. Three-dimensional computing machine symbol-editing information processing cells, as opposed to Turing’s two-dimensional machine tape squares, can take advantage of a denumerably infinite potential for parallel digital sequence computing, by which to accommodate denumerably infinitely many computable diagonalizations. A three-dimensional model of machine information storage and processing cells is recommended on independent grounds as better representing the biological realities of digital information processing isomorphisms in the three-dimensional neural networks of living computers.

Quantum phases of dimerized and frustrated Heisenberg spin chains with s=1/2, 1 and 3/2: an entanglement entropy and fidelity study

We study here different regions in phase diagrams of the spin-1/2, spin-1 and spin-3/2 one-dimensional antiferromagnetic Heisenberg systems with frustration (next-nearest-neighbor interaction J(2)) and dimerization (delta). In particular, we analyze the behaviors of the bipartite entanglement entropy and fidelity at the gapless to gapped phase transitions and across the lines separating different phases in the J(2)-delta plane. All the calculations in this work are based on numerical exact diagonalizations of finite systems.

Eigenvalue analyses for non-transposed three-phase transmission line considering non-implicit ground wires

This paper presents a method for analyzing electromagnetic transients using real transformation matrices in three-phase systems considering the presence of ground wires. So, for the Z and Y matrices that represent the transmission line, the characteristics of ground wires are not implied in the values related to the phases. A first approach uses a real transformation matrix for the entire frequency range considered in this case. This transformation matrix is an approximation to the exact transformation matrix. For those elements related to the phases of the considered system, the transformation matrix is composed of the elements of Clarke's matrix. In part related to the ground wires, the elements of the transformation matrix must establish a relationship with the elements of the phases considering the establishment of a single homopolar reference in the mode domain. In the case of three-phase lines with the presence of two ground wires, it is unable to get the full diagonalization of the matrices Z and Y in the mode domain. This leads to the second proposal for the composition of real transformation matrix: obtain such transformation matrix from the multiplication of two real and constant matrices. In this case, the inclusion of a second matrix had the objective to minimize errors from the first proposal for the composition of the transformation matrix mentioned. © 2012 IEEE.