A Universal Turing Machine is demonstrated on a DNA-based computer.
Background: Report on DNA-based Computers Workshop by John Amenyo
Ambiguity clause: I will judge this claim based on its precise wording, unless this wording conflicts with my perception of the intent of the claim. If both intent and wording are ambiguous, I will look for a solution that causes the least damage to FX as a market and game. If you have any questions, or think you may have found a loophole, please contact me!!
Infinite storage capacity (infinite tape) and infinite lifespan are not required for this claim, as long as there is no conceptual limit to the size of problems solved. Otherwise current-day electronic computers would not be considered to be UTM's either.