m-chrzan.xyz
aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorMarcin Chrzanowski <mc370754@students.mimuw.edu.pl>2022-07-02 18:05:02 +0200
committerMarcin Chrzanowski <mc370754@students.mimuw.edu.pl>2022-07-02 18:05:02 +0200
commitc696f12275697687909af940248889499bb23a42 (patch)
tree200bd14b7e28f07dc54157ecdeaf3433d722b14d
parent67fa27c467f570852f22cc31e2f352a90e66fa62 (diff)
Add computational model section
-rw-r--r--mgr.tex6
1 files changed, 6 insertions, 0 deletions
diff --git a/mgr.tex b/mgr.tex
index c066fe6..16c4e7a 100644
--- a/mgr.tex
+++ b/mgr.tex
@@ -326,6 +326,12 @@ automaton, there is a corresponding MSO formula), however we will use only the
MSO to automata direction in this work. See for example BojaƄczyk's text
\cite{bojanczyktoolbox} for a proof of both directions.
+\subsection{Computational Model}
+
+We use the Random Access Machine (RAM) model with uniform cost measure. In
+particular, basic arithmetic operations are assigned a constant cost, regardless
+of bitlength of arguments.
+
\section{Question answering problems}\label{query-answering-problems}
Consider a computational problem whose inputs are of the form $(S, q) \in