-
Notifications
You must be signed in to change notification settings - Fork 0
Issues: rihardsk/HeadClasses
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Author
Label
Projects
Milestones
Assignee
Sort
Issues list
• Maybe it is hidden in the details, but I have not found any point where the usage of the $p$-adic norm actually matters. Do your results still hold if one replaces $p$-adic numbers by the reals and $p$-adic norm by the absolute value?
general_motivation
mfcs_review
wontfix
#39
opened Aug 7, 2014 by
balodis
• In the proof of lemma 1, why do you assume that $\mathcal{T}$ uses exactly two tapes and that the size of the second tape's contents is logarithmically bounded? It seems like you assume $\mathcal{T}$ to be one of the $u_ptm$ you constructed earlier to simulate a $u_pfa(k)$. If this is the case, you should state it.
mfcs_review
#38
opened Aug 7, 2014 by
balodis
• Add an example as indicated above (But the authors do not give an (even just theoretical) example showing why p-ultrametric automata could be useful in CS. Perhaps the results of Balodis et al. [1] are the main motivation, but this is not clear.)
general_motivation
mfcs_review
wontfix
#34
opened Aug 7, 2014 by
balodis
• page 8, Definition 7: Why do you require that the amplitudes are $p$-constructible sets?
mfcs_review
#28
opened Aug 7, 2014 by
balodis
• Ultrametric computation is a new area where only very few papers have been published. This improves the papers' chance to be accepted but this demands from the authors to pay more attention to give examples of ultrametric automata. Unfortunately, the authors have not done this.
enhancement
general_motivation
mfcs_review
wontfix
#14
opened Aug 7, 2014 by
balodis
the Authors should much more stress the possible advantages of their approach and give the proper context to understand their results. E.g. in Sec. 4.3 it is proved that languages recognizable by multihead ultrametric automata have similar structure to languages recognizable by probabilistic, nondeterministic and deterministic automata. Were we to expect something different? Any answer to this question is welcome.
enhancement
general_motivation
wontfix
#8
opened Apr 22, 2014 by
rihardsk
Intro, pg.1, third paragraph of the Introduction: rewrite in more details
#4
opened Mar 14, 2014 by
balodis
ProTip!
no:milestone will show everything without a milestone.