From: Martin Mares <mj@ucw.cz>
Date: Sat, 19 Apr 2008 15:26:17 +0000 (+0200)
Subject: Removing FIXME's.
X-Git-Tag: printed~76
X-Git-Url: http://mj.ucw.cz/gitweb/?a=commitdiff_plain;h=e81dbcb7bbd44e518aa00c06ec2db76267aa02da;p=saga.git

Removing FIXME's.
---

diff --git a/ram.tex b/ram.tex
index ea64a87..85118f1 100644
--- a/ram.tex
+++ b/ram.tex
@@ -215,8 +215,6 @@ remainders which take $\O(W^2)$.\foot{We could use more efficient arithmetic
 algorithms, but the quadratic bound is good enough for our purposes.}
 \qed
 
-\FIXME{Add references, especially to the unbounded parallelism remark.}
-
 \thm
 Every program for the PM running in polynomial time can be translated to a~program
 computing the same on the Word-RAM with only $\O(1)$ slowdown.
@@ -234,8 +232,6 @@ with an~additional instruction for generating a~single random bit. The standard
 techniques of design and analysis of randomized algorithms apply (see for
 example Motwani and Raghavan~\cite{motwani:randalg}).
 
-\FIXME{Consult sources. Does it make more sense to generate random words at once on the RAM?}
-
 \rem
 There is one more interesting machine: the \df{Immutable Pointer Machine} (see
 the description of LISP machines in \cite{benamram:pm}). It differs from the