Computing beyond the turing limit using the h systems

Authors:
Cezar Câmpeanu;Andrei Păun
Affiliations:
Department of Computer Science and Information Technology, University of Prince Edward Island, Charlottetown, P.E.I., Canada;Department of Computer Science, College of Engineering and Science, Louisiana Tech University, Ruston, Louisiana
Venue:
DNA'04 Proceedings of the 10th international conference on DNA computing
Year:
2004

Citing 8
Cited 1

Information randomness & incompleteness: papers on algorithmic information theory (2nd ed.)

Information randomness & incompleteness: papers on algorithmic information theory (2nd ed.)
Controlled H systems of small radius

Fundamenta Informaticae
Hypercomputation: hype or computation?

Communications of the ACM - Evolving data mining into solutions for insights
Handbook of Formal Languages

Handbook of Formal Languages
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Hypercomputation

Minds and Machines
A Universal Time-Varying Distributed H System of Degree 1

DNA 7 Revised Papers from the 7th International Workshop on DNA-Based Computers: DNA Computing
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)

DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)

Membrane system models for super-Turing paradigms

Natural Computing: an international journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a new variant of the heavily studied model of H systems. The new variant will use an external factor to determine the set of the active splicing rules. We improve the best known universality result for time-varying H systems with respect to the diameter of such a system and we prove that if the function recording the behavior of the external factor is uncomputable so is the newly defined model, thus exceeding the Turing barrier. We also construct an universal system that is also more powerful than the Turing Machines.