1 research outputs found
A note on time hierarchies for reasonable semantic classes without advice
We show time hierarchies for reasonable semantic classes without advice by
eliminating the constant bits of advice in previous results.The elimination is
done by a contrapositive argument that for any reasonable computational
model,let denote the set of all languages decide by
machines running in time with advice of bits in that model, if
then
where is a
constant integer.Comment: There is a mistake in the argument,take BPTIME as example, after
fixing the advice,the new uniform probablistic machine probably won't satisfy
BP promise any more. Pointed out by Professor Fortno