Biological substrates

Molecular and DNA computing

Encode bounded computational states and operations in molecules and laboratory transformations.

molecularestablished research

Evidence status

Cites 1 source, none of which has been read

The source is named, but it has been retrieved and read as part of building this page. Nothing here has been matched to a passage, so the citations show where a reader might look rather than what was checked.

Rely on this page for

Orientation: how the topic is organised, which terms matter, and where to start reading.

Do not rely on it for

A claim you intend to act on or repeat. Follow the cited material yourself first.

Working definition

Molecular computing uses chemical species, binding, reactions, synthesis, separation, or sequencing to encode and transform information. DNA computing can exploit massive molecular parallelism, but practical assessment must include material preparation, error correction, reaction time, laboratory operations, readout, waste, and instance-specific encoding—not merely the number of simultaneous molecules.

Mechanism

  • Encode an instance into molecular species.
  • Apply reactions and selection operations.
  • Read out and verify candidate solutions.

Measurements

  • Yield and error rate
  • Wall-clock and laboratory effort
  • Material, energy, and readout cost

Reproducibility controls

  • Version hardware, software, firmware, and analysis code.
  • Declare dataset, preprocessing, random seeds, and measurement boundary.
  • Report repeated runs, variation, exclusions, and failed trials.

Limits and failure modes

  • Wet-lab parallelism has substantial overhead.
  • One encoded problem is not a programmable computer.

Mathematical connection

Formal structure without substrate erasure

computational modelConstraint satisfaction →

Molecular candidate filtering

Represent encoded candidate solutions and the laboratory operations intended to eliminate invalid states.

Inputs

  • Problem constraints
  • Molecular encoding
  • Reaction and selection error

Outputs

  • Candidate pool
  • Expected false positives
  • Readout burden

Limit: The abstraction omits wet-lab preparation, reaction kinetics, material scale, contamination, sequencing, and human labor unless explicitly modeled.

Technical and governance sources

  1. [1]Molecular computation of solutions to combinatorial problems · Science

    Establishes: A foundational experiment using molecular biology operations and DNA strands to encode and recover a solution to one small directed Hamiltonian-path instance.

    Boundary: The experiment demonstrates a bounded molecular computation. It does not establish practical general-purpose DNA computing, favorable end-to-end energy or latency, autonomous operation, or scalability beyond the reported instance.

Related concepts

molecular

Synthetic biological circuits

hybrid

Benchmarking, energy, and task equivalence

hybrid

Biosafety, ethics, and governance

Direct answer

  • Molecular computing uses chemical species, binding, reactions, synthesis, separation, or sequencing to encode and transform information. DNA computing can exploit massive molecular parallelism, but practical assessment must include material preparation, error correction, reaction time, laboratory operations, readout, waste, and instance-specific encoding—not merely the number of simultaneous molecules.

Mechanism and method

  • Encode an instance into molecular species.
  • Apply reactions and selection operations.
  • Read out and verify candidate solutions.

What is measured

  • Yield and error rate
  • Wall-clock and laboratory effort
  • Material, energy, and readout cost

Limitations

  • Wet-lab parallelism has substantial overhead.
  • One encoded problem is not a programmable computer.

Boundaries declared by the cited sources

  • The experiment demonstrates a bounded molecular computation. It does not establish practical general-purpose DNA computing, favorable end-to-end energy or latency, autonomous operation, or scalability beyond the reported instance. (boundary declared by Molecular computation of solutions to combinatorial problems)

Bridge: Molecular candidate filtering

  • Represent encoded candidate solutions and the laboratory operations intended to eliminate invalid states.
  • Input: Problem constraints
  • Input: Molecular encoding
  • Input: Reaction and selection error
  • Output: Candidate pool
  • Output: Expected false positives
  • Output: Readout burden
  • Limit: The abstraction omits wet-lab preparation, reaction kinetics, material scale, contamination, sequencing, and human labor unless explicitly modeled.

Related records