Fundamenta Informaticae · 2006 · 120 citations · 4 references
ComputingComputer ScienceMathematicsMathematical EconomicsNumber TheoryTheory Of ComputationAutomata TheoryComputational ComplexityComputational MathematicsComputational ModelsNumerical AlgorithmsTuring MachinesComputable NumbersFinite-state ProcessesNondeterministic Turing Machines
With inspiration from the economic reality, where numbers are basic entities to work with, we propose a genuinely new kind of P systems, where numerical variables evolve, starting from initial values, by means of production functions and repartition protocols. We prove that non-deterministic systems of this type, using polynomial production functions, characterize the Turing computable sets of natural numbers, while deterministic systems, with polynomial production functions having non-negative coefficients, compute strictly more than semilinear sets of natural numbers. A series of research topics to be addressed in this framework are mentioned.
4
The Mathematical Theory of L Systems
Grzegorz Rozenberg, Arto Salomaa · DAIMI Report Series · 1974 · 827 citations · Full text
The encyclopedia of integer sequences
Choice Reviews Online · 1995 · 603 citations
Martin Davis, Yuri Matiyasevich · American Mathematical Monthly · 1995 · 457 citations