FX Home
All Accounts
Mailing Lists

Your Account
Your Profile


Contact Us

Claim DNAT - DNA-based Turing machine demo

Category: Science & Technology:Computer Technology & Benchmarks JUDGED at 0
Judge:483, patrik
due date:2000/01/01

The Claim

A Universal Turing Machine is demonstrated on a DNA-based computer.

Report on DNA-based Computers Workshop by John Amenyo

Judge's Statement

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.

The Market

Your Buy YES Orders Players Buying YES Coupons
Price Plot for life of DNAT
Last trade price: 0
Current ask price: 100
Current bid price: 0
Pairs outstanding: 541
Players participating: 27
View the ticker for this Claim.

Your cash balance: 749.00
Your holdings in this Claim: 0
Your UID:
Your password:
Your Sell YES Orders Players Selling YES Coupons

Back to my account page.