[PATCH 1/2] future/QC: Fix typos

[PATCH 1/2] future/QC: Fix typos

[SeongJae Park]

Signed-off-by: SeongJae Park <sj38.park@gmail.com>
---
 future/QC.tex | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/future/QC.tex b/future/QC.tex
index d16c080..f985437 100644
--- a/future/QC.tex
+++ b/future/QC.tex
@@ -411,7 +411,7 @@ ten digits of precision.
 If this was all that QC provided, QC would be a rather slow and very
 low-quality analog computer.
 Given that digital computers obsoleted analog computers some decades back,
-This analogy might lead many developers to ignore QC and to
+this analogy might lead many developers to ignore QC and to
 use classic-computing floating point instead.
 However, QC provides a powerful capability covered in the next section.

@@ -798,7 +798,7 @@ For example, perhaps machine-learning techniques will allow difficult
 cases to be detected so that alternative solution methods can be applied
 as needed.

-Of course, much of this work has been heuristic and/or probabalistic,
+Of course, much of this work has been heuristic and/or probabilistic,
 so it might at first glance seem unfair to compare them to
 QC algorithms.
 However, QC algorithms are inherently probabilistic due to error rates
-- 
2.10.0

[PATCH 2/2] future/QC: Add space before citation

[SeongJae Park]

Signed-off-by: SeongJae Park <sj38.park@gmail.com>
---
 future/QC.tex | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/future/QC.tex b/future/QC.tex
index f985437..f873cd7 100644
--- a/future/QC.tex
+++ b/future/QC.tex
@@ -1058,7 +1058,7 @@ of logistics, but current classic heuristics can find near-optimal
 solutions for hundreds of cities~\cite{Martin:1992:LMC:2307953.2308141}
 and polynomial-time algorithms that are guaranteed to find routes
 that are no more than 40\% longer than optimal for arbitrarily
-large numbers of cities\cite{Sebo:2014:STN:2688265.2688281},
+large numbers of cities~\cite{Sebo:2014:STN:2688265.2688281},
 improving on the 50\% bound located a few decades
 earlier~\cite{NicosChristofides1976TSP-FiftyPercent}.
 As of 2006 TSP solvers were finding optimal solutions to
-- 
2.10.0

Re: [PATCH 1/2] future/QC: Fix typos

[Paul E. McKenney]

On Fri, Jul 14, 2017 at 08:19:22AM +0900, SeongJae Park wrote:
> Signed-off-by: SeongJae Park <sj38.park@gmail.com>

Good eyes, both applied, thank you!

							Thanx, Paul

> ---
>  future/QC.tex | 4 ++--
>  1 file changed, 2 insertions(+), 2 deletions(-)
> 
> diff --git a/future/QC.tex b/future/QC.tex
> index d16c080..f985437 100644
> --- a/future/QC.tex
> +++ b/future/QC.tex
> @@ -411,7 +411,7 @@ ten digits of precision.
>  If this was all that QC provided, QC would be a rather slow and very
>  low-quality analog computer.
>  Given that digital computers obsoleted analog computers some decades back,
> -This analogy might lead many developers to ignore QC and to
> +this analogy might lead many developers to ignore QC and to
>  use classic-computing floating point instead.
>  However, QC provides a powerful capability covered in the next section.
> 
> @@ -798,7 +798,7 @@ For example, perhaps machine-learning techniques will allow difficult
>  cases to be detected so that alternative solution methods can be applied
>  as needed.
> 
> -Of course, much of this work has been heuristic and/or probabalistic,
> +Of course, much of this work has been heuristic and/or probabilistic,
>  so it might at first glance seem unfair to compare them to
>  QC algorithms.
>  However, QC algorithms are inherently probabilistic due to error rates
> -- 
> 2.10.0
>