Computing in Finite Time

DOI10.1007/S11080-006-8221-1MaRDI QIDQ3408878zbMATH OpenOpenAlexFDO

Authors Alexis De Vos

Publication date 3 November 2006

Published in Open Systems & Information Dynamics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11080-006-8221-1

zbMATH Keywords

entropyprobability distributionreversible computation

Mathematics Subject Classification ID

Information theory (general) (94A15) Measures of information, entropy (94A17)

Recommendations

• On the computational complexity of finite operations
• TIME BOUNDED COMPUTATIONS OVER THE REALS
• On genuinely time bounded computations
• Decision times of infinite computations
• Publication:3487327
• scientific article; zbMATH DE number 4006252
• ON THE NOTION OF LINEAR TIME COMPUTABILITY
• On lower bounds for the time of computation
• Computational Complexity Via Finite Types
• STACS 2005

Cites work

• scientific article; zbMATH DE number 3155533 (Why is no real title available?)
• A nonlinear model for relaxation in excited closed physical systems
• Equipartition principles in finite-time thermodynamics
• Information entropy of Gegenbauer polynomials
• On the Mixture of Distributions
• The Expectation Value of the Entropy of a Digital Message
• The entropy of a mixture of probability distributions

Cited in

(6)

• Six Synthesis Methods for Reversible Logic
• scientific article; zbMATH DE number 5622695 (Why is no real title available?)
• A note on the entropy of computation
• Computability of entropy and information in classical Hamiltonian systems
• Computation with Narrow CTCs
• The entropy of a mixture of probability distributions

This page was built for publication: Computing in Finite Time

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