The many facets of natural computing
The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Abstract
Natural computing builds a bridge between computer science and natural sciences.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Kennedy, J., & Eberhart, R. (2002) · Proceedings of ICNN'95 - International Conference on Neural Networks · doi:10.1109/icnn.1995.488968 · Cited by 58,192
Learning representations by back-propagating errors
Rumelhart, D. E., Hinton, G. E., & Williams, R. J. (1986) · Nature · doi:10.1038/323533a0 · Cited by 31,892
Quantum Computation and Quantum Information
Nielsen, M. A., Chuang, I., & Grover, L. K. (2002) · American Journal of Physics · doi:10.1119/1.1463744 · Cited by 21,895
A logical calculus of the ideas immanent in nervous activity
McCulloch, W. S., & Pitts, W. (1943) · The Bulletin of Mathematical Biophysics · doi:10.1007/bf02478259 · Cited by 18,566
Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
Bennett, C. H., Brassard, G., Crépeau, C., Jozsa, R., Peres, A., & Wootters, W. K. (1993) · Physical Review Letters · doi:10.1103/physrevlett.70.1895 · Cited by 13,703
A fast quantum mechanical algorithm for database search
Grover, L. K. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237866 · Cited by 8,830
Algorithms for quantum computation: discrete logarithms and factoring
Shor, P. W. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365700 · Cited by 8,713 · cited 1×
“The theoretical results that catapulted quantum computing to the forefront of computing research were Shor’s quantum algorithms for factoring integers and extracting discrete logarithms in polynomial time, obtained in 1994, [110] – the same year that saw the first DNA computing experiment by Adleman.”
BackgroundQuantum cryptography: Public key distribution and coin tossing
Bennett, C. H., & Brassard, G. (2014) · Theoretical Computer Science · doi:10.1016/j.tcs.2014.05.025 · Cited by 8,299
Quantum cryptography: Public key distribution and coin tossing
Bennett, C. H., & Brassard, G. (2020) · arXiv · doi:10.48550/arxiv.2003.06557 · Cited by 8,299
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691
Quantum theory, the Church–Turing principle and the universal quantum computer
Deutsch, D. (1985) · Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences · doi:10.1098/rspa.1985.0070 · Cited by 4,597
The Danger Model: A Renewed Sense of Self
Matzinger, P. (2002) · Science · doi:10.1126/science.1071059 · Cited by 4,205
Feynman, R. P. (1986) · Foundations of Physics · doi:10.1007/bf01886518 · Cited by 1,770
Delves, P. J., & Roitt, I. M. (2000) · New England Journal of Medicine · doi:10.1056/nejm200007063430107 · Cited by 1,666
Foundations for engineering biology
Endy, D. (2005) · Nature · doi:10.1038/nature04342 · Cited by 1,511 · cited 1×
“There arguably is a pressing need for standardization, modularization, and abstraction, to allow focusing on design principles without reference to lower-level details, [34].”
BackgroundBenioff, P. (1980) · Journal of Statistical Physics · doi:10.1007/bf01011339 · Cited by 1,244 · cited 2×
“[13] P.”
BackgroundEntanglement-based quantum communication over 144 km
Ursin, R., Tiefenbacher, F., Schmitt-Manderbach, T., Weier, H., Scheidl, T., Lindenthal, M., Blauensteiner, B., Jennewein, T., Perdigues, J., Trojek, P., et al. (2007) · Nature Physics · doi:10.1038/nphys629 · Cited by 1,210 · cited 2×
“Recently, [117], an open air experiment was reported in quantum cryptography (not involving optical cable) over a distance of 144 km, conducted between two Canary islands.”
BackgroundSynthetic biology: new engineering rules for an emerging discipline
Andrianantoandro, E., Basu, S., Karig, D. K., & Weiss, R. (2006) · Molecular Systems Biology · doi:10.1038/msb4100073 · Cited by 1,081
A 1.7-kilobase single-stranded DNA that folds into a nanoscale octahedron
Shih, W. M., Quispe, J. D., & Joyce, G. F. (2004) · Nature · doi:10.1038/nature02307 · Cited by 989 · cited 1×
“Recent experimental research into programmable molecular-scale devices has produced impressive self-assembled DNA nanostructures, [105], such as cubes, [23], [105], octahedra, [ 108 ], Sierpinski triangles, [96], DNA origami, [95], or intricate nanostructures that achieve computation such as binary counting, [8], or b…”
BackgroundLogical computation using algorithmic self-assembly of DNA triple-crossover molecules
Mao, C., LaBean, T. H., Reif, J. H., & Seeman, N. C. (2000) · Nature · doi:10.1038/35035038 · Cited by 779 · cited 1×
“…devices has produced impressive self-assembled DNA nanostructures, [105], such as cubes, [23], [105], octahedra, [108], Sierpinski tri-angles, [96], DNA origami, [95], or intricate nanostructures that achieve computation such as binary counting, [8], or bit-wise cumulative XOR, [71].”
BackgroundFrom in vivo to in silico biology and back
Di Ventura, B., Lemerle, C., Michalodimitrakis, K., & Serrano, L. (2006) · Nature · doi:10.1038/nature05127 · Cited by 290 · cited 1×
“On one hand it means the use of quantitative algorithms for computations, or simulations that complement experiments in hypothesis generation and validation, [31].”
Method
Cited by
Developing pervasive multi-agent systems with nature-inspired coordination
Zambonelli, F., Omicini, A., Anzengruber, B., Castelli, G., De Angelis, F. L., Serugendo, G. D. M., Dobson, S., Fernandez-Marquez, J. L., Ferscha, A., Mamei, M., et al. (2015) · Pervasive and Mobile Computing · doi:10.1016/j.pmcj.2014.12.002 · Cited by 96
Segmenting images with gradient-based edge detection using Membrane Computing
Díaz-Pernil, D., Berciano, A., Peña-Cantillana, F., & Gutiérrez-Naranjo, M. A. (2013) · Pattern Recognition Letters · doi:10.1016/j.patrec.2012.10.014 · Cited by 60
Metadata
- Authors
- Kari, L., & Rozenberg, G.
- Venue
- Communications of the ACM
- Published
- 2008-10
- Volume
- 51
- Issue
- 10
- Pages
- 72-83
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W1984638028
- Cited by
- 237
- References
- 21
- FWCI
- 6.95
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.