Systems software technology and business
One can obviously easily construct a Turing machine, which for every formula F in first order predicate logic and every natural number n , allows one to decide if there is a proof of F of length n (length = number of symbols). Let ψ(F, n) be the number of steps the machine requires for [...]
11/23/2009 please see the updated version: here. Yet another version of the recursion/transducer paper . The main result is that simultaneous primitive recursion on strings corresponds to general products of state machines.
Primitive recursion on strings is analogous to primitive recursion on integers where we define f(0) = constant and f(n+1) = g(f(n)). In strings the [...]
An interesting paper appearing in ASPLOS proceedings provides a “deterministic” locking method
Kendo enforces a deterministic interleaving of lock acquisitions and specially declared non-protected reads through a novel dynamically load-balanced deterministic scheduling algorithm. The algorithm tracks the progress of each thread using performance counters to construct a deterministic logical time that is used to compute an [...]
I dropped my subscription to the IEEE “Digital Library” because I found that if I strayed from a very narrow range of areas, the IEEE wanted ridiculous fees for access to papers. For example, despite a subscription to the digital library, I was not entitled to papers in power engineering. Now I find that the [...]