marshray
Joined 16 years ago
Joined 16 years ago
Wouldn't that also include functions that can be evaluated in hardware using a fixed number of gates? E.g., symmetric cryptography?
Doesn't that lead me to an existence proof (i.e., a solution) to a k-SAT problem in N*(subexponential_time and polynomial_space)?
And with constant folding, N is reduced by 1 on each iteration.
What obvious thing am I missing here?
The similarities look obvious, but how are these situations different? Seems like an interesting question.
I didn't really get this book the first time through.
The end of the first book made me wish for a paper copy I could throw against the wall :-D
Apparently there are typographic markers which were completely lost in the audiobook version. It made very little sense to me until about halfway through.