On the Computational Complexity of Spiking Neural P Systems (Q3543343): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-540-85194-3_16
+Normal rank
@@ Property / OpenAlex ID @@
+W2143489009
@@ Property / OpenAlex ID: W2143489009 / rank @@
+Normal rank
@@ Property / cites work @@
+Counter machines and counter languages
@@ Property / cites work: Counter machines and counter languages / rank @@
+Normal rank
@@ Property / cites work @@
+Q5480659
@@ Property / cites work: Q5480659 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2969106
@@ Property / cites work: Q2969106 / rank @@
+Normal rank
@@ Property / cites work @@
+Solving Numerical NP-Complete Problems with Spiking Neural P Systems
+Normal rank
@@ Property / cites work @@
+P-completeness of Cellular Automaton Rule 110
@@ Property / cites work: P-completeness of Cellular Automaton Rule 110 / rank @@
+Normal rank
@@ Property / cites work @@
+Four Small Universal Turing Machines
@@ Property / cites work: Four Small Universal Turing Machines / rank @@
+Normal rank
@@ Property / cites work @@
+Small Semi-weakly Universal Turing Machines
@@ Property / cites work: Small Semi-weakly Universal Turing Machines / rank @@
+Normal rank
@@ Property / cites work @@
+Membrane computing. An introduction.
@@ Property / cites work: Membrane computing. An introduction. / rank @@
+Normal rank