394 search results - page 9 / 79 » Logical operations and Kolmogorov complexity |
ENTCS
2006
13 years 8 months ago
2006
Parkinson, Bornat, and Calcagno recently introduced a logic for partial correctness in which program variables are treated as resource, generalizing earlier work based on separati...
PDPTA
2003
13 years 10 months ago
2003
Common binary arithmetic operations such as addition/subtraction and multiplication suffer from O(n) carry propagation delay where n is the number of digits. Carry lookahead helps...
APNOMS
2006
Springer
14 years 14 days ago
2006
Springer
Abstract. The Next Generation Network (NGN) has a multilayer logical construction. Network carriers use various tools in complex procedures to operate application servers on the NG...
ENTCS
2002
13 years 8 months ago
2002
Solovay showed that there are noncomputable reals such that H( n) H(1n) + O(1), where H is prefix-free Kolmogorov complexity. Such H-trivial reals are interesting due to the conn...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
We propose two alternatives to Xu’s axiomatization of Chellas’s STIT. The first one simplifies its presentation, and also provides an alternative axiomatization of the delib...