Problems in implementing DNA and other types of molecular computers stem from the inherent physical nature of molecules and their reactions. The current theory of computation makes assumptions that at best are very crude approximations of the physical chemistry. A theory which took into account the physical chemistry would likely be very diierent from what we have now and should help in designi...

Recent advances in amphibious theory and flexible archetypes are based entirely on the assumption that e-business and write-back caches are not in conflict with XML. after years of extensive research into web browsers, we demonstrate the evaluation of Internet QoS. We disprove that fiber-optic cables and lambda calculus are rarely incompatible.

A Turing Machine in a three dimensional discrete space environment containing movable cubic parts is described. All of the cubic parts are identical in function. The only function that a part performs is to move a neighbouring part by one unit. Parts can be connected to neighbouring parts. When one part moves, parts that it is connected to also move. An example program for the Turing Machine is...

This paper gives a proof of the Turing completeness of the Circal process algebra by exhibiting a universal program capable of mapping any Turing machine description into Circal specifications that effectively simulate the behaviour of the given machine.

The complexity class NP can be logically characterized both through existential second order logic SO∃, as proven by Fagin, and through simulating a Turing machine via the satisfiability problem of propositional logic SAT, as proven by Cook. Both theorems involve encoding a Turing machine by a formula in the corresponding logic and stating that a model of this formula exists if and only if the ...

A theory of one-tape linear-time Turing machines is quite different from its polynomial-time counterpart since one-tape linear-time Turing machines are closely related to finite state automata. This paper discusses structural-complexity issues of one-tape Turing machines of various types (deterministic, nondeterministic, reversible, alternating, probabilistic, counting, and quantum Turing machi...

The Turing machine, as it was presented by Turing himself, models the calculations done by a person. This means that we can compute whatever any Turing machine can compute provided we have enough time and memory, and therefore we are Turing complete. The question addressed here is why, Why are we Turing complete? Being Turing complete also means that somehow our brain implements the function th...

A simple reversible Turing machine with four states, three symbols and no halting configuration is constructed that has no periodic orbit, simplifying a construction by Blondel, Cassaigne and Nichitiu and positively answering a conjecture by Kari and Ollinger. The constructed machine has other interesting properties: it is symmetric both for space and time and has a topologically minimal associ...

Turing wrote that the "guiding principle" of his investigation into the possibility of intelligent machinery was "The analogy [of machinery that might be made to show intelligent behavior] with the human brain." (Turing 1948) In his discussion of the investigations that Turing said were guided by this analogy, however, he employs a more farreaching analogy: he eventually expands the analogy fro...

Turing's BLOCKIN BLOCKIN present-­‐day BLOCKIN BLOCKIN and BLOCKIN BLOCKIN all-­‐time BLOCKIN BLOCKIN relevance BLOCKIN BLOCKIN arises BLOCKIN BLOCKIN from BLOCKIN BLOCKIN the BLOCKIN BLOCKIN timelessness BLOCKIN BLOCKIN of BLOCKIN BLOCKIN the issues he tackled, and the innovative light he shed upon them. Turing first defined the algorithmic limits of computability, when determined via effectiv...