Book in the works by Alexander Stepanov

[Chris R. Miller]

superdan wrote:
> Manfred_Nowak Wrote:
>> Sorrily Stepanov gives no answer for the immidiately rising question 
>> what the restriction of a finite computational basis implies for 
>> computational hard/intractable problems.
> 
> and care to explain how exactly what you said is not balderdash laminated in elevated words.

Because I'm reading the document and it has mathematical proofs as well
as numerous (about 133) citations to works widely regarded as fact.

Read before declaring it BS.  Otherwise we have to refer you the
dictionary under the entry of "bigotry" for your information.

-------------- next part --------------
A non-text attachment was scrubbed...
Name: signature.asc
Type: application/pgp-signature
Size: 258 bytes
Desc: OpenPGP digital signature
URL: <http://lists.puremagic.com/pipermail/digitalmars-d-announce/attachments/20080907/481f03b7/attachment.pgp>