Skip to contentSkip to conversation

future/QC: Fix typos

PATCH In review SeongJae Park 2 participants 3 messages Jul 13, 2017 – Jul 15, 2017

lore
Share & tools
lore
#0 lore raw

PATCH 1/2 future/QC: Fix typos

---
 future/QC.tex | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)
future/QC.tex +2 -2
index d16c080..f985437 100644
@@ -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
Signature · 1 line
2.10.0
#1 lore raw

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

---
 future/QC.tex | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)
future/QC.tex +1 -1
index f985437..f873cd7 100644
@@ -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
Signature · 1 line
2.10.0
#2 lore raw
In reply to SeongJae Park
Quoted 1 line · SeongJae Park

Good eyes, both applied, thank you!

Thanx, Paul

Quoted 29 lines
---
 future/QC.tex | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)
future/QC.tex +2 -2
index d16c080..f985437 100644
@@ -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
Signature · 1 line
2.10.0