2000 character limit reached
The physical limit of logical compare operation (1408.0445v1)
Published 3 Aug 2014 in physics.data-an, cond-mat.stat-mech, and cs.CC
Abstract: In this paper two connected Szilard single molecule engines (with different temperature) model of Maxwell's demon are used to demonstrate and analysis the logical compare operation. The logical and physical complexity of compare operations are both showed to be kTln2. Then this limit was used to prove the time complexity lower bound of sorting problem. It confirmed the proposed way to measure the complexity of a problem, provided another evidence of the equivalence between information theoretical and thermodynamic entropies.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.