en.unionpedia.org

Membrane computing, the Glossary

Index Membrane computing

Membrane computing (or MC) is an area within computer science that seeks to discover new computational models from the study of biological cells, particularly of the cellular membranes.[1]

Table of Contents

  1. 13 relations: Boolean satisfiability problem, Cell (biology), Cell membrane, Cellular model, Computational model, Computer science, Euclidean space, Gheorghe Păun, Modelling biological systems, P system, Parallel computing, Travelling salesman problem, Unconventional computing.

Boolean satisfiability problem

In logic and computer science, the Boolean satisfiability problem (sometimes called propositional satisfiability problem and abbreviated SATISFIABILITY, SAT or B-SAT) is the problem of determining if there exists an interpretation that satisfies a given Boolean formula.

See Membrane computing and Boolean satisfiability problem

Cell (biology)

The cell is the basic structural and functional unit of all forms of life.

See Membrane computing and Cell (biology)

Cell membrane

The cell membrane (also known as the plasma membrane or cytoplasmic membrane, and historically referred to as the plasmalemma) is a biological membrane that separates and protects the interior of a cell from the outside environment (the extracellular space).

See Membrane computing and Cell membrane

Cellular model

A cellular model is a mathematical model of aspects of a biological cell, for the purposes of in silico research.

See Membrane computing and Cellular model

Computational model

A computational model uses computer programs to simulate and study complex systems using an algorithmic or mechanistic approach and is widely used in a diverse range of fields spanning from physics, engineering, chemistry and biology to economics, psychology, cognitive science and computer science. Membrane computing and computational model are models of computation.

See Membrane computing and Computational model

Computer science

Computer science is the study of computation, information, and automation.

See Membrane computing and Computer science

Euclidean space

Euclidean space is the fundamental space of geometry, intended to represent physical space.

See Membrane computing and Euclidean space

Gheorghe Păun

Gheorghe Păun (born December 6, 1950, in Cicănești, Argeș County) is a computer scientist from Romania, prominent for work on membrane computing and the P system.

See Membrane computing and Gheorghe Păun

Modelling biological systems

Modelling biological systems is a significant task of systems biology and mathematical biology.

See Membrane computing and Modelling biological systems

P system

A P system is a computational model in the field of computer science that performs calculations using a biologically inspired process. Membrane computing and p system are models of computation.

See Membrane computing and P system

Parallel computing

Parallel computing is a type of computation in which many calculations or processes are carried out simultaneously.

See Membrane computing and Parallel computing

Travelling salesman problem

The travelling salesman problem, also known as the travelling salesperson problem (TSP), asks the following question: "Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city?" It is an NP-hard problem in combinatorial optimization, important in theoretical computer science and operations research.

See Membrane computing and Travelling salesman problem

Unconventional computing

Unconventional computing (also known as alternative computing or nonstandard computation) is computing by any of a wide range of new or unusual methods. Membrane computing and Unconventional computing are Classes of computers.

See Membrane computing and Unconventional computing

References

[1] https://en.wikipedia.org/wiki/Membrane_computing