This is a Position paper that argues large language models (LLMs) capable of generating code from natural language prompts, specifically OpenAI’s Codex and GPT-3, are poised to transform both chemistry research and chemistry education. Published in the inaugural volume of Digital Discovery (RSC), the paper combines a brief history of NLP developments with concrete demonstrations of code generation for computational chemistry tasks, then offers a forward-looking perspective on challenges and opportunities.

Bridging the Gap Between Natural Language and Scientific Software

The authors identify a core friction in modern computational chemistry: while the number of available software packages has grown dramatically, researchers spend a large fraction of their time learning interfaces to these packages rather than doing science. Tasks like searching documentation, following tutorials, and trial-and-error experimentation with APIs consume effort that could be directed at research itself.

At the same time, programming assignments in chemistry courses serve dual pedagogical purposes (reinforcing physical intuition and teaching marketable skills), but are constrained by students’ median programming experience. The emergence of code-generating NLP models opens the possibility of reducing both barriers simultaneously.

Code Generation as a Chemistry Interface

The paper’s core thesis is that NLP models trained on code can serve as a natural language interface to the entire ecosystem of scientific computing tools. The authors demonstrate this with several concrete examples using OpenAI Codex:

1. Quantum chemistry: Prompting Codex to “compute the dissociation curve of H2 using pyscf” produced correct, runnable code that selected Hartree-Fock with STO-3G. A follow-up prompt requesting “the most accurate method” caused it to switch to CCSD in a large basis set.

2. Chemical entity recognition: Using GPT-3 with only three training examples, the authors demonstrated extraction of chemical entity names from published text, a task that previously required thousands of labeled examples.

3. Molecular visualization: Drawing caffeine from its SMILES string, generating Gaussian input files from SMILES, implementing random walks, and downloading and analyzing PDB structures with MDTraj.

4. Voice-controlled molecular dynamics: The authors previously built MARVIS, a voice-controlled molecular dynamics analysis tool that uses GPT-3 to convert natural language into VMD commands. Only about a dozen examples were needed to teach GPT-3 to render proteins, change representations, and select atoms.

An important caveat: the authors emphasize that all chemistry “knowledge” (including the SMILES string for caffeine) is entirely contained in the model’s learned floating-point weights. The model has no access to databases or curated lists of chemical concepts.

Demonstrations and Practical Evaluation

Rather than a formal experimental evaluation with benchmarks and metrics, this perspective paper relies on qualitative demonstrations. The key examples, with full details provided in the ESI, include:

The authors note that Codex generates correct code at about a 30% rate on a single attempt for standard problems, improving to above 50% when multiple solutions are tried. Mistakes tend to occur when complex algorithms are requested with little specificity, and the code rarely has syntax errors but may fail in obvious ways (missing imports, wrong data types).

Challenges: Access, Correctness, and Bias

The paper identifies three ongoing challenges:

Access and price. Advanced models from OpenAI were, at the time of writing, limited to early testers. Per-query costs (1-3 cents for GPT-3) would become prohibitive at the scale needed for parsing academic literature or supporting medium-sized courses. The authors advocate for open-source models and equitable deployment by researchers with computational resources.

Correctness. Code generation does not guarantee correctness. The authors raise a subtle point: Codex may produce code that executes successfully but does not follow best scientific practice for a particular computational task. Over-reliance on AI-generated code without verification could erode trust in scientific software. However, they argue that strategies for assessing code correctness apply equally to human-written and AI-generated code.

Fairness and bias. The authors flag several concerns: AI-generated code trained on its own outputs could narrow the range of packages, methods, or programming languages used in chemistry. They observed Codex’s preference for Python and for specific popular libraries (e.g., defaulting to Psi4 for single-point energy calculations). GPT-3 has also been shown to reflect racism, sexism, and other biases present in its training data.

Implications for Research and Education

The authors conclude with an optimistic but measured outlook:

• For research: NLP code generation will increase accessibility of software tools and expand what a single research group can accomplish. Better tools have historically not reduced the need for scientists but expanded the complexity of problems that can be tackled.
• For programming skills: Using Codex will make chemists better programmers, not worse. The process of crafting prompts, mentally checking outputs, testing on sample inputs, and iterating develops algorithmic thinking. The authors report discovering chemistry software libraries they would not have found otherwise through iterative prompt creation.
• For education: Instructors should rethink programming assignments. The authors suggest moving toward more difficult compound assignments, treating code exercises as laboratory explorations of scientific concepts rather than syntax drills, and aligning coursework with the tools students will have access to in their careers.
• For accessibility: NLP models can reduce barriers for non-native English speakers (though accuracy with non-English prompts was not fully explored) and for users who have difficulty with keyboard-and-mouse interfaces (via voice control).

The paper acknowledges that these capabilities were, in early 2022, just beginning, with Codex being the first capable code-generation model. Already at the time of writing, models surpassing GPT-3 in language tasks had appeared, and models matching GPT-3 with 1/20th the parameters had been demonstrated.

Reproducibility Details

This is a perspective paper with qualitative demonstrations rather than a reproducible experimental study. The authors provide all prompts and multiple responses in the ESI.

Data

All prompts and code outputs are provided in the Electronic Supplementary Information (ESI) available from the RSC.

Algorithms

The paper does not introduce new algorithms. It evaluates existing models (GPT-3, Codex) on chemistry-related code generation tasks.

Models

Evaluation

No formal metrics are reported for the chemistry demonstrations. The authors cite the Codex paper’s reported ~30% pass rate on single attempts and >50% with multiple attempts on standard programming problems.

Hardware

No hardware requirements are specified for the demonstrations (API-based inference).

Artifacts

Paper Information

Citation: Hocky, G. M., & White, A. D. (2022). Natural language processing models that automate programming will transform chemistry research and teaching. Digital Discovery, 1(2), 79-83. https://doi.org/10.1039/d1dd00009h

@article{hocky2022natural,
  title={Natural language processing models that automate programming will transform chemistry research and teaching},
  author={Hocky, Glen M. and White, Andrew D.},
  journal={Digital Discovery},
  volume={1},
  number={2},
  pages={79--83},
  year={2022},
  publisher={Royal Society of Chemistry},
  doi={10.1039/d1dd00009h}
}

This is a Position paper that argues genetic algorithms (GAs) are underused and underappreciated as baselines in the molecular generation community. The primary contribution is empirical evidence that a simple GA implementation (MOL_GA) matches or outperforms many sophisticated deep learning methods on standard benchmarks. The authors propose the “GA criterion” as a minimum bar for evaluating new molecular generation algorithms.

Why Molecular Generation May Be Easier Than Assumed

Drug discovery is fundamentally a molecular generation task, and many machine learning methods have been proposed for it (Du et al., 2022). The problem has many variants, from unconditional generation of novel molecules to directed optimization of specific molecular properties.

The authors observe that generating valid molecules is, in some respects, straightforward. The rules governing molecular validity are well-defined bond constraints that can be checked using standard cheminformatics software like RDKit. This means new molecules can be generated simply by adding, removing, or substituting fragments of known molecules. When applied iteratively, this is exactly what a genetic algorithm does. Despite this, many papers in the field propose complex deep learning methods without adequately comparing to simple GA baselines.

The GA Criterion for Evaluating New Methods

The core proposal is the GA criterion: new methods in molecular generation should offer some clear advantage over genetic algorithms. This advantage can be:

• Empirical: outperforming GAs on relevant benchmarks
• Conceptual: identifying and overcoming a specific limitation of randomly modifying known molecules

The authors argue that the current state of molecular generation research reflects poor empirical practices, where comprehensive baseline evaluation is treated as optional rather than essential.

Genetic Algorithm Framework and Benchmark Experiments

How Genetic Algorithms Work for Molecules

GAs operate through the following iterative procedure:

1. Start with an initial population $P$ of molecules
2. Sample a subset $S \subseteq P$ from the population (possibly biased toward better molecules)
3. Generate new molecules $N$ from $S$ via mutation and crossover operations
4. Select a new population $P’$ from $P \cup N$ (e.g., keep the highest-scoring molecules)
5. Set $P \leftarrow P’$ and repeat from step 2

The MOL_GA implementation uses:

• Quantile-based sampling (step 2): molecules are sampled from the top quantiles of the population using a log-uniform distribution over quantile thresholds:

$$ u \sim \mathcal{U}[-3, 0], \quad \epsilon = 10^{u} $$

A molecule is drawn uniformly from the top $\epsilon$ fraction of the population.

• Mutation and crossover (step 3): graph-based operations from Jensen (2019), as implemented in the GuacaMol benchmark (Brown et al., 2019)
• Greedy population selection (step 4): molecules with the highest scores are retained

Unconditional Generation on ZINC 250K

The first experiment evaluates unconditional molecule generation, where the task is to produce novel, valid, and unique molecules distinct from a reference set (ZINC 250K). Success is measured by validity, novelty (at 10,000 generated molecules), and uniqueness.

All methods perform near 100% on all metrics, demonstrating that unconditional molecule generation is not a particularly discriminative benchmark. The authors note that generation speed (molecules per second) is an important missing dimension from these comparisons, where simple methods like GAs have a clear advantage.

Molecule Optimization on the PMO Benchmark

The second experiment evaluates directed molecule optimization on the Practical Molecular Optimization (PMO) benchmark (Gao et al., 2022), which measures the ability to find molecules optimizing a scalar objective function $f: \mathcal{M} \mapsto \mathbb{R}$ with a budget of 10,000 evaluations.

A key insight is that previous GA implementations in PMO used large generation sizes ($\approx 100$), which limits the number of improvement iterations. The authors set the generation size to 5, allowing approximately 2,000 iterations of improvement within the same evaluation budget.

MOL_GA achieves the highest aggregate score across all 23 PMO tasks, outperforming both the previous best GA (Graph GA) and the previous best overall method (REINVENT). The authors attribute this partly to the tuning of the baselines in PMO rather than MOL_GA being an especially strong method, since MOL_GA is essentially the same algorithm as Graph GA with different hyperparameters.

Implications for Molecular Generation Research

The key findings and arguments are:

1. GAs match or outperform deep learning methods on standard molecular generation benchmarks, both for unconditional generation and directed optimization.

2. Hyperparameter choices matter significantly: MOL_GA’s strong performance on PMO comes partly from using a smaller generation size (5 vs. ~100), which allows more iterations of refinement within the same evaluation budget.

3. The GA criterion should be enforced in peer review: new molecular generation methods should demonstrate a clear advantage over GAs, whether empirical or conceptual.

4. Deep learning methods may implicitly do what GAs do explicitly: many generative models are trained on datasets of known molecules, so the novel molecules they produce may simply be variants of their training data. The authors consider this an important direction for future investigation.

5. Poor empirical practices are widespread: the paper argues that many experiments in molecule generation are conducted with an explicit desired outcome (that the novel algorithm is the best), leading to inadequate baseline comparisons.

The authors are careful to note that this result should not be interpreted as GAs being exceptional algorithms. Rather, it is an indication that more complex methods have made surprisingly little progress beyond what simple heuristic search can achieve.

Reproducibility Details

Data

Algorithms

• GA implementation: MOL_GA package, using graph-based mutation and crossover from Jensen (2019) via the GuacaMol implementation
• Generation size: 5 molecules per iteration (allowing ~2,000 iterations with 10,000 evaluations)
• Population selection: Greedy (highest-scoring molecules retained)
• Sampling: Quantile-based with log-uniform distribution over quantile thresholds

Evaluation

Hardware

The paper does not specify hardware requirements. Given that GAs are computationally lightweight compared to deep learning methods, standard CPU hardware is likely sufficient.

Artifacts

Paper Information

Citation: Tripp, A., & Hernández-Lobato, J. M. (2023). Genetic algorithms are strong baselines for molecule generation. arXiv preprint arXiv:2310.09267. https://arxiv.org/abs/2310.09267

Publication: arXiv preprint, 2023

Additional Resources:

• MOL_GA Python Package (GitHub)
• MOL_GA on PyPI

Citation

@article{tripp2023genetic,
  title={Genetic algorithms are strong baselines for molecule generation},
  author={Tripp, Austin and Hern{\'a}ndez-Lobato, Jos{\'e} Miguel},
  journal={arXiv preprint arXiv:2310.09267},
  year={2023}
}

This is a Position paper (perspective) that proposes a research agenda for molecular representations in AI. It reviews the evolution of chemical notation over 250 years and argues for extending SELFIES-style robust representations beyond traditional organic chemistry into polymers, crystals, reactions, and other complex chemical systems.

The Generative Bottleneck in Traditional Representations

While SMILES has been the standard molecular representation since 1988, its fundamental weakness for machine learning is well-established: randomly generated SMILES strings are often invalid. The motivation is twofold:

1. Current problem: Traditional representations (SMILES, InChI, DeepSMILES) lack 100% robustness; random mutations or generations can produce invalid strings, limiting their use in generative AI models.
2. Future opportunity: SELFIES solved this for small organic molecules, but many important chemical domains (polymers, crystals, reactions) still lack robust representations, creating a bottleneck for AI-driven discovery in these areas.

16 Concrete Research Directions for SELFIES

The novelty is in the comprehensive research roadmap. The authors propose 16 concrete research projects organized around key themes:

• Domain extension: Includes metaSELFIES for learning graph rules directly from data, BigSELFIES for stochastic polymers, and crystal structures via labeled quotient graphs.
• Chemical reactions: Robust reaction representations that enforce conservation laws.
• Programming perspective: Treating molecular representations as programming languages, potentially achieving Turing-completeness.
• Benchmarking: Systematic comparisons across representation formats.
• Interpretability: Understanding how humans and machines actually learn from different representations.

Evidence from Generative Case Studies

This perspective paper includes case studies:

1. Pasithea (Deep Molecular Dreaming): A generative model that first learns to predict a chemical property from a one-hot encoded SELFIES, then freezes the network weights and uses gradient descent on the one-hot input encoding to optimize molecular properties (logP). The target property increases or decreases nearly monotonically, demonstrating that the model has learned meaningful structure-property relationships from the SELFIES representation.

2. DECIMER and STOUT: DECIMER (Deep lEarning for Chemical ImagE Recognition) is an image-to-structure tool, and STOUT (SMILES-TO-IUPAC-name Translator) translates between IUPAC names and molecular string representations. Both show improved performance when using SELFIES as an intermediate representation. STOUT internally converts SMILES to SELFIES before processing and decodes predicted SELFIES back to SMILES. These results suggest SELFIES provides a more learnable internal representation for sequence-to-sequence models.

Strategic Outcomes and Future Vision

The paper establishes robust representations as a fundamental bottleneck in computational chemistry and proposes a clear path forward:

Key outcomes:

• Identification of 16 concrete research projects spanning domain extension, benchmarking, and interpretability
• Evidence that SELFIES enables capabilities (like smooth property optimization) impossible with traditional formats
• Framework for thinking about molecular representations as programming languages

Strategic impact: The proposed extensions could enable new applications across drug discovery (efficient exploration beyond small molecules), materials design (systematic crystal structure discovery), synthesis planning (better reaction representations), and fundamental research (new ways to understand chemical behavior).

Future vision: The authors emphasize that robust representations could become a bridge for bidirectional learning between humans and machines, enabling humans to learn new chemical concepts from AI systems.

The Mechanism of Robustness

The key difference between SELFIES and other representations lies in how they handle syntax:

• SMILES/DeepSMILES: Rely on non-local markers (opening/closing parentheses or ring numbers) that must be balanced. A mutation or random generation can easily break this balance, producing invalid strings.
• SELFIES: Uses a formal grammar (automaton) where derivation rules are entirely local. The critical innovation is overloading: a state-modifying symbol like [Branch1] starts a branch and changes the interpretation of the next symbol to represent a numerical parameter (the branch length).

This overloading mechanism ensures that any arbitrary sequence of SELFIES tokens can be parsed into a valid molecular graph. The derivation can never fail because every symbol either adds an atom or modifies how subsequent symbols are interpreted.

The 16 Research Projects: Technical Details

This section provides technical details on the proposed research directions:

Extending to New Domains

metaSELFIES (Project 1): The authors propose learning graph construction rules automatically from data. This could enable robust representations for any graph-based system, from quantum optics to biological networks, without needing domain-specific expertise.

Token Optimization (Project 2): SELFIES uses “overloading” where a symbol’s meaning changes based on context. This project would investigate how this affects machine learning performance and whether the approach can be optimized.

Handling Complex Molecular Systems

BigSELFIES (Project 3): Current representations struggle with large, often random structures like polymers and biomolecules. BigSELFIES would combine hierarchical notation with stochastic building blocks to handle these complex systems where traditional small-molecule representations break down.

Crystal Structures (Projects 4-5): Crystals present unique challenges due to their infinite, periodic arrangements. An infinite net cannot be represented by a finite string directly. The proposed approach uses labeled quotient graphs (LQGs), which are finite graphs that uniquely determine a periodic net. However, current SELFIES cannot represent LQGs because they lack symbols for edge directions and edge labels (vector shifts encoding periodicity). Extending SELFIES to handle these structures could enable AI-driven materials design without relying on predefined crystal structures, opening up systematic exploration of theoretical materials space.

Beyond Organic Chemistry (Project 6): Transition metals and main-group compounds feature complex bonding that breaks the simple two-center, two-electron model. The solution: use machine learning on large structural databases to automatically learn these complex bonding rules.

Chemical Reactions and Programming Concepts

Reaction Representations (Project 7): Moving beyond static molecules to represent chemical transformations. A robust reaction format would enforce conservation laws and could learn reactivity patterns from large reaction datasets, improving synthesis planning.

Developing a 100% Robust Programming Language

Programming Language Perspective (Projects 8-9): An intriguing reframing views molecular representations as programming languages executed by chemical parsers. This opens possibilities for adding loops, logic, and other programming concepts to efficiently describe complex structures. The ambitious goal is a Turing-complete programming language that is also 100% robust. While fascinating, it is worth critically noting that enforcing 100% syntactical robustness inherently restricts grammar flexibility. Can a purely robust string representation realistically describe highly fuzzy, delocalized electron bonds (like in Project 6) without becoming impractically long or collapsing into specialized sub-languages?

Empirical Comparisons (Projects 10-11): With multiple representation options (strings, matrices, images), we need systematic comparisons. The proposed benchmarks would go beyond simple validity metrics to focus on real-world design objectives in drug discovery, catalysis, and materials science.

Human Readability (Project 12): While SMILES is often called “human-readable,” this claim lacks scientific validation. The proposed study would test how well humans actually understand different molecular representations.

Machine Learning Perspectives (Projects 13-16): These projects explore how machines interpret molecular representations:

• Training networks to translate between formats to find universal representations
• Comparing learning efficiency across different formats
• Investigating latent space smoothness in generative models
• Visualizing what models actually learn about molecular structure

Reproducibility Details

Since this is a position paper outlining future research directions, standard empirical reproducibility metrics do not apply. However, the foundational tools required to pursue the proposed roadmap are open-source.

Paper Information

Citation: Krenn, M., Ai, Q., Barthel, S., Carson, N., Frei, A., Frey, N. C., Friederich, P., Gaudin, T., Gayle, A. A., Jablonka, K. M., Lameiro, R. F., Lemm, D., Lo, A., Moosavi, S. M., Nápoles-Duarte, J. M., Nigam, A., Pollice, R., Rajan, K., Schatzschneider, U., … Aspuru-Guzik, A. (2022). SELFIES and the future of molecular string representations. Patterns, 3(10). https://doi.org/10.1016/j.patter.2022.100588

Publication: Patterns 2022

@article{Krenn2022,
  title = {SELFIES and the future of molecular string representations},
  volume = {3},
  ISSN = {2666-3899},
  url = {http://dx.doi.org/10.1016/j.patter.2022.100588},
  DOI = {10.1016/j.patter.2022.100588},
  number = {10},
  journal = {Patterns},
  publisher = {Elsevier BV},
  author = {Krenn, Mario and Ai, Qianxiang and Barthel, Senja and Carson, Nessa and Frei, Angelo and Frey, Nathan C. and Friederich, Pascal and Gaudin, Théophile and Gayle, Alberto Alexander and Jablonka, Kevin Maik and Lameiro, Rafael F. and Lemm, Dominik and Lo, Alston and Moosavi, Seyed Mohamad and Nápoles-Duarte, José Manuel and Nigam, AkshatKumar and Pollice, Robert and Rajan, Kohulan and Schatzschneider, Ulrich and Schwaller, Philippe and Skreta, Marta and Smit, Berend and Strieth-Kalthoff, Felix and Sun, Chong and Tom, Gary and von Rudorff, Guido Falk and Wang, Andrew and White, Andrew and Young, Adamo and Yu, Rose and Aspuru-Guzik, Alán},
  year = {2022},
  month = oct,
  pages = {100588}
}

Additional Resources:

• Original SELFIES Paper
• SELFIES Overview

This is technically a transcription of a conference talk, not a paper Levinthal wrote himself. The proceedings page credits “Notes by: A. Rawitch, Retranscribed: B. Krantz”, meaning what we have is a third-party record of an oral presentation Levinthal gave at the 1969 Mössbauer Spectroscopy in Biological Systems meeting at Allerton House, Illinois. This explains the informal, conversational register and the attached Q&A discussion.

In terms of contribution type, it functions as a Position paper (with Theory and Discovery elements):

• Position: Defines a “Grand Challenge” and argues for a conceptual shift in how we view biomolecular assembly
• Theory: Uses formal combinatorial arguments to establish the bounds of the search space ($10^{300}$ configurations)
• Discovery: Uses experimental data on alkaline phosphatase to validate the kinetic hypothesis

What is the motivation?

The Central Question: How does a protein choose one unique structure out of a hyper-astronomical number of possibilities in a biological timeframe (seconds)?

Levinthal provides a “back-of-the-envelope” derivation to define the problem scope:

1. Degrees of Freedom: A generic, unrestricted protein with 2,000 atoms would possess ~6,000 degrees of freedom. However, physical constraints (specifically the planar peptide bond) reduce this significantly. For a 150-amino acid protein, these constraints lower the complexity to ~450 degrees of freedom (300 rotations, 150 bond angles).
2. The Combinatorial Explosion: Even with conservative estimates, this results in $10^{300}$ possible conformations.
3. The Time Constraint: Since proteins fold in seconds, Levinthal argues they can sample at most $10^8$ conformations (“postulating a minimum time from one conformation to another”) before stabilizing. Against $10^{300}$ possibilities, this search effectively covers 0% of the space, proving the impossibility of random search.

The Insight: The existence of folded proteins proves the impossibility of random global search. The system must be guided.

What is the novelty here?

Core Contribution: Levinthal reframes folding from a thermodynamic problem (seeking the absolute global minimum) to a Kinetic Control problem. He argues the native state is a “metastable” energy well found quickly by a specific pathway, which can differ from the system’s lowest possible energy state.

The Pathway Dependence Hypothesis

The key insights of kinetic control:

• Nucleation: The process is “speeded and guided by the rapid formation of local interactions”
• Pathway Constraints: Local amino acid sequences form stable interactions and serve as nucleation points in the folding process, restricting the conformational search space
• The “Metastable” State: The final structure represents a “metastable state” in a sufficiently deep energy well that is kinetically accessible via the folding pathway, independent of the global energy minimum. Think of a ball that rolls into a valley on the side of a hill and stays there: it is not in the lowest valley on the entire landscape, but it is stable enough that it never escapes.

What experiments were performed?

To support the pathway hypothesis, Levinthal cites work on Alkaline Phosphatase (MW ~40,000), utilizing its property as a dimer of two identical subunits:

• Renaturation Window: The wild-type enzyme refolds optimally at 37°C. However, mutants were isolated that only produce active enzyme (and renature) at temperatures below 37°C.
• Stability vs. Formation: Crucially, once folded, both the wild-type and mutant enzymes are stable up to 90°C.
• The Rate-Limiting Step: Levinthal notes that the rate-limiting step for activity is the formation of the dimer from monomers. This proves that the order of assembly (kinetic pathway) dictates the final structure, distinct from the final structure’s thermodynamic stability.

The talk concluded with a short motion picture Levinthal showed live, illustrating polypeptide synthesis and “the process of then forming a desired interaction via the most favored energy path as displayed on the computer controlled oscilloscope.”

The Q&A discussion following the talk includes one exchange directly relevant to the folding argument: when asked whether a protein is ever truly unfolded (devoid of all secondary and tertiary structure), Levinthal answered that both physical measurements and synthetic polypeptide work suggest yes. The other exchanges concerned the tangent formula for x-ray crystallographic phase refinement and whether computed structures had been tested for thermal perturbations.

What outcomes/conclusions?

Key Finding

The mutant experiments serve as the “smoking gun”: a protein seeking a global thermodynamic minimum would fold spontaneously at any temperature where the final state is stable (up to 90°C). The fact that mutants require specific lower temperatures for formation (while remaining stable at high temperatures once formed) proves that the kinetic pathway determines the outcome alongside the thermodynamic endpoint.

Broader Implications

Levinthal explicitly asks: “Is a unique folding necessary for any random 150-amino acid sequence?” and answers “Probably not.” He supports this by noting the difficulty many researchers face in attempting to crystallize proteins, suggesting that not all sequences produce stably folded structures.

He concludes by connecting these computational models to Mössbauer spectroscopy, suggesting that these computational studies may help in understanding how small perturbations of polypeptide structures affect the Mössbauer nucleus (a reminder of the specific conference context where this perspective was delivered).

Connection to Modern Work

Levinthal’s arguments remain relevant context for modern computational protein folding:

• Early computational visualization: Levinthal used computer-controlled oscilloscopes and vector matrix multiplications to build and display 3D polypeptide structures, and showed a motion picture of forming a desired interaction via the most favored energy path. This was an early instance of computational molecular visualization.
• Local interactions and folding pathways: The hypothesis that “local interactions” serve as nucleation points that guide folding remains central to how modern structure prediction methods (e.g., AlphaFold) model residue-residue interactions.
• The paradox’s lasting influence: The impossibility of random conformational search that Levinthal articulated continues to motivate approaches that exploit the structure of the energy landscape rather than exhaustive enumeration.
• Sequence-structure relationship: Levinthal’s suggestion that not every random amino acid sequence would fold uniquely foreshadows the modern challenge of inverse folding (protein design), where the goal is to find sequences within the subset that does fold to a target structure.

Paper Information

Citation: Levinthal, C. (1969). How to Fold Graciously. In Mössbauer Spectroscopy in Biological Systems: Proceedings of a meeting held at Allerton House, Monticello, Illinois (pp. 22-24). University of Illinois Press.

Publication: Mössbauer Spectroscopy in Biological Systems Proceedings, 1969

@inproceedings{levinthal1969fold,
  title={How to fold graciously},
  author={Levinthal, Cyrus},
  booktitle={M{\"o}ssbauer spectroscopy in biological systems},
  pages={22--24},
  year={1969},
  publisher={University of Illinois Press},
  url={https://faculty.cc.gatech.edu/~turk/bio_sim/articles/proteins_levinthal_1969.pdf}
}

Additional Resources:

• Levinthal’s Paradox (Wikipedia)