We describe a method to axiomatize computations in deterministic Turing machines (TMs). When applied to computations in non-deterministic TMs, this method may produce contradictor...
—Alan Turing proposed a test for the intelligence of machines in 1950 [1]. Despite great efforts, no computer has passed this test so far. Each year, chat bots compete for the Lo...
We preliminarily recap what is meant by complexity and non-Turing computation, by way of explanation of our title, ‘Computational Complexity in Non-Turing Models of Computation...
In formal language theory, many families of languages are defined using grammars or finite acceptors like pushdown automata and Turing machines. For instance, context-sensitive l...