Keyword

computational completeness

Description: A property of a formal computational system whose rules can express or simulate every computation in a specified universal model.

Primary topic: DNA and Biological Computing (54%)

OpenAlex ID: keywords/computational-completeness

Spiking Neural P Systems

2006 · Mihai Ionescu, Gheorghe Păun, et al. · Fundamenta Informaticae · 812

The power of communication: P systems with symport/antiport

2002 · Andrei Pâun, Gheorghe Pâun · New Generation Computing · 340

Cut and paste

1997 · Paolo Atzeni, Giansalvatore Mecca · 182

On the Complexity of Distributed Network Decomposition

1996 · Alessandro Panconesi, Aravind Srinivasan · Journal of Algorithms · 176

Asynchronous spiking neural P systems

2009 · Matteo Cavaliere, Oscar H. Ibarra, et al. · Theoretical Computer Science · 157

PDF

Spiking neural P systems with rules on synapses

2014 · Tao Song, Linqiang Pan, et al. · Theoretical Computer Science · 142

Spike Trains in Spiking Neural P Systems

2006 · GHEORGHE PĂUN, MARIO J. PÉREZ-JIMÉNEZ, et al. · International Journal of Foundations of Computer Science · 140

Spiking Neural P Systems With Polarizations

2017 · Tingfang Wu, Andrei Păun, et al. · IEEE Transactions on Neural Networks and Learning Systems · 139

Spiking neural P systems with inhibitory rules

2019 · Hong Peng, Bo Li, et al. · Knowledge-Based Systems · 117

Normal forms for spiking neural P systems

2006 · Oscar H. Ibarra, Andrei Păun, et al. · Theoretical Computer Science · 105

PDF

G-Log: a graph-based query language

1995 · J. Paredaens, P. Peelman, et al. · IEEE Transactions on Knowledge and Data Engineering · 100

Power from Random Strings

2006 · Eric Allender, Harry Buhrman, et al. · SIAM Journal on Computing · 94

Test Tube Distributed Systems Based on Splicing

1996 · Erzsébet Csuhaj-Varjú, Lila Kari, et al. · 83

DNA Computing Based on Splicing: The Existence of Universal Computers

1999 · R. Freund · Theory of Computing Systems · 73

Asynchronous P Systems and P Systems Working in the Sequential Mode

2005 · Rudolf Freund · Lecture notes in computer science · 69

Unification as a complexity measure for logic programming

1987 · A. Itai, J.A. Makowsky · The Journal of Logic Programming · 65

Computational Completeness of Programming Languages Based on Graph Transformation

2001 · Annegret Habel, Detlef Plump · Lecture notes in computer science · 63

PDF

On P Systems with Active Membranes

2001 · Andrei Păun · Springer eBooks · 60

An improved universal spiking neural P system with generalized use of rules

2019 · Yun Jiang, Yansen Su, et al. · Journal of Membrane Computing · 50

Towards Unconditional Soundness: Computationally Complete Symbolic Attacker

2012 · Gergei Bana, Hubert Comon-Lundh · Lecture notes in computer science · 46

Graph-Controlled Insertion-Deletion Systems

2010 · Rudolf Freund, Marian Kogler, et al. · Electronic Proceedings in Theoretical Computer Science · 45

On the Power of P Systems with Symport Rules

2002 · Carlos Martín-vide, Andrei Păun, et al. · 45

P Systems with Membrane Creation: Universality and Efficiency

2001 · Madhu Mutyam, Kamala Krithivasan · Lecture notes in computer science · 45

Spiking Neural P Systems with a Generalized Use of Rules

2014 · Xingyi Zhang, Bangju Wang, et al. · Neural Computation · 44

Computing with viruses

2015 · Xu Chen, Mario J. Pérez-Jiménez, et al. · Theoretical Computer Science · 42

PDF

Works count: 438

Citation count: 5,678