http://courses.csail.mit.edu/6.849/fall10/lectures/
من همین الآن دیدم این درس هم جزو درسهای ما هست. فقط امیدوارم ترم بعد هم ارائه شود.
اگر Y یک الگوریتم (a,b)-تقریبی برای X باشد یعنی
X <= Y <= a.X+b
http://groups.csail.mit.edu/tds/seminars/s10/Onak-consttime-slides.pdf
http://groups.csail.mit.edu/tds/seminars/s10/tds-seminars-s10.html
Subtraction is similar, except that borrows, rather than carries, are propagated to the left. If the borrow extends past the end of the word it is said to have "wrapped around", a condition called an "end-around borrow". When this occurs, the bit must be subtracted from the right-most bit. This phenomenon does not occur in two's complement arithmetic.
0000 0110 6 − 0001 0011 19 =========== ==== 1 1111 0011 −12 —An end-around borrow is produced, and the sign bit of the intermediate result is 1. − 0000 0001 1 —Subtract the end-around borrow from the result. =========== ==== 1111 0010 −13 —The correct result (6 − 19 = -13)
الآن از استاد درس داده کاویمون پرسیدم که نمره ام خوبه یا بده گفت نمره ی دوم-سوم کلاسی. :)
خواستم به خودم موفقیت ترم قبلم رو تبریک بگم!