Bit copying: the ultimate computational simplicity

MaRDI QIDQ2888174zbMATH OpenFDO

Authors Oleg Mazonka

Publication date 30 May 2012

Published in Complex Systems (Search for Journal in Brave)

zbMATH Keywords

bit copyingcomputational abstract machinelogic operationsreferencing

Mathematics Subject Classification ID

Theory of programming languages (68N15) Theory of compilers and interpreters (68N20)

Recommendations

• On the notion of bit complexity
• The Complexity of Bit Retrieval
• Computing Boolean functions from multiple faulty copies of input bits
• scientific article; zbMATH DE number 2086255
• scientific article; zbMATH DE number 4085015
• scientific article; zbMATH DE number 1949653
• A new efficient computational algorithm for bit reversal mapping
• The complexity of analog computation
• Complexity via replica trick
• A fundamental lower bound of the cost for bit reset

Cited in

(3)

• Mirror notations: Symbol manipulation without inscription manipulation
• scientific article; zbMATH DE number 1542874 (Why is no real title available?)
• scientific article; zbMATH DE number 1418489 (Why is no real title available?)

This page was built for publication: Bit copying: the ultimate computational simplicity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2888174)