scientific article; zbMATH DE number 1512850
The authors use different notions of functions computable by a Turing machine. Depending on the definition they prove that the set of configurations used by a Turing machine for modeling other computations may be non-recursive. In the case of a machine computing a function on a set with the help of the empty tape it is proved that there are such machines for which the corresponding sets of configurations are not recursively enumerable. An application of this result is the folowing: There is a universal Turing machine which does not compute a function on any set. For the entire collection see [Zbl 0939.00010].
- Turing projectability
- Castor quadruplorum
- Turing machines for dummies. Why representations do matter
- Honest universality
- The ``paradox of computability and a recursive relative version of the busy beaver function
- Turing machines on Cayley graphs
- On reversible Turing machines and their function universality
- Observability of Turing machines: a refinement of the theory of computation
- The stability of Turing machine in computing real functions
- scientific article; zbMATH DE number 4094815 (Why is no real title available?)
- scientific article; zbMATH DE number 3521955 (Why is no real title available?)
- Some characterizations of functions computable in on-line arithmetic
- Turing machines: universality and limits of computational power
- scientific article; zbMATH DE number 4114612 (Why is no real title available?)
- On non-computable functions
- Ecological Turing machines
- Symmetry of the universal computable function: a study of its automorphisms, homomorphisms and isomorphic embeddings
- On Formalisms for Turing Machines
- The dependence of computability on numerical notations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4508548)