Skip to main content
SpringerLink
Log in
Book cover

International Conference on Theory and Applications of Models of Computation

TAMC 2015: Theory and Applications of Models of Computation pp 50–61Cite as

Structured Frequency Algorithms

  • Conference paper
  • First Online:

  • 711 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9076))

Abstract

B.A. Trakhtenbrot proved that in frequency computability (introduced by G. Rose) it is crucially important whether the frequency exceeds \(\frac{1}{2}\). If it does then only recursive sets are frequency-computable. If the frequency does not exceed \(\frac{1}{2}\) then a continuum of sets is frequency-computable. Similar results for finite automata were proved by E.B. Kinber and H. Austinat et al. We generalize the notion of frequency computability demanding a specific structure for the correct answers. We show that if this structure is described in terms of finite projective planes then even a frequency \(O(\frac{\sqrt{n}}{n})\) ensures recursivity of the computable set. We also show that with overlapping structures this frequency cannot be significantly decreased. We also introduce the notion of graph frequency computation and prove sufficient conditions for a graph \(G\) such that a continuum of sets can be \(G\)-computed.

K. Balodis—The first author has been supported by the European Social Fund within the project Support for Doctoral Studies at University of Latvia.

R. Freivalds—The research was supported by Co-operation Project “Uzticamas un kontrolētas mobilo ierīču pielietojuma vides izpēte un saistīto ekspertu rīku izveides iespējas” and by Project 271/2012 from the Latvian Council of Science.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Ablaev, F., Freivalds, R.: Why sometimes probabilistic algorithms can be more effective. In: Wiedermann, J., Gruska, J., Rovan, B. (eds.) MFCS 1986. LNCS, vol. 233, pp. 1–14. Springer, Heidelberg (1986)

    Chapter  Google Scholar 

  2. Austinat, H., Diekert, V., Hertrampf, U., Petersen, H.: Regular frequency computations. Theoret. Comput. Sci. 330(1), 15–21 (2005). Insightful Theory

    Article  MATH  MathSciNet  Google Scholar 

  3. Degtev, A.N.: On \((m, n)\)-computable sets. In: Moldavanskij, D.I. (ed.), Algebraic Systems, pp. 88–99. Ivanovo Gos. Universitet, (1981) (In Russian)

    Google Scholar 

  4. Freivalds, R.: Inductive inference of recursive functions: qualitative theory. In: Barzdins, J., Bjorner, D. (eds.) Baltic Computer Science. LNCS, vol. 502, pp. 77–110. Springer, Heidelberg (1991)

    Chapter  Google Scholar 

  5. Hall Jr., M.: Combinatorial Theory, 2nd edn. Wiley, New York (1986)

    MATH  Google Scholar 

  6. Harizanov, V., Kummer, M., Owings, J.: Frequency computations and the cardinality theorem. J. Symb. Log. 57, 682–687 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  7. Hinrichs, M., Wechsung, G.: Time bounded frequency computations. In: Proceedings of Twelfth Annual IEEE Conference on Computational Complexity, 1997 (Formerly: Structure in Complexity Theory Conference), pp. 185–192. IEEE (1997)

    Google Scholar 

  8. Kinber, E.B.: Frequency calculations of general recursive predicates and frequency enumerations of sets. Sov. Math. 13, 873–876 (1972)

    MATH  Google Scholar 

  9. Kinber, E.B.: Frequency computations in finite automata. Cybern. Sys. Anal. 12(2), 179–187 (1976)

    Article  Google Scholar 

  10. König, D.: Sur les correspondances multivoques des ensembles. Fundamenta Math. 8(1), 114–134 (1926)

    MATH  Google Scholar 

  11. McNaughton, R.: The theory of automata, a survey. Adv. Comput. 2, 379–421 (1961)

    Article  MATH  MathSciNet  Google Scholar 

  12. Rabin, M.O.: Probabilistic automata. Inf. Control 6(3), 230–245 (1963)

    Article  MATH  Google Scholar 

  13. Rabin, M.O., Scott, D.: Finite automata and their decision problems. IBM J. Res. Dev. 3(2), 114–125 (1959)

    Article  MathSciNet  Google Scholar 

  14. Rose, G.F.: An extended notion of computability. In: International Congress for Logic, Methodology and Philosophy of Science, Stanford, California (1960)

    Google Scholar 

  15. Tantau, T.: Towards a cardinality theorem for finite automata. In: Diks, K., Rytter, W. (eds.) MFCS 2002. LNCS, vol. 2420, pp. 625–636. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  16. Trakhtenbrot, B.A.: On the frequency computation of functions. Algebra i Logika 2(1), 25–32 (1964). In Russian

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Computing, University of Latvia, Raiņa bulvāris 19, Riga, 1586, Latvia

    Kaspars Balodis, Jānis Iraids & Rūsiņš Freivalds

  2. Institute of Mathematics and Computer Science, University of Latvia, Raiņa bulvāris 29, Riga, 1459, Latvia

    Kaspars Balodis, Jānis Iraids & Rūsiņš Freivalds

Authors
  1. Kaspars Balodis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jānis Iraids
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Rūsiņš Freivalds
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kaspars Balodis .

Editor information

Editors and Affiliations

  1. National University of Singapore, Singapore, Singapore

    Rahul Jain

  2. National University of Singapore, Singapore, Singapore

    Sanjay Jain

  3. National University of Singapore, Singapore, Singapore

    Frank Stephan

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Balodis, K., Iraids, J., Freivalds, R. (2015). Structured Frequency Algorithms. In: Jain, R., Jain, S., Stephan, F. (eds) Theory and Applications of Models of Computation. TAMC 2015. Lecture Notes in Computer Science(), vol 9076. Springer, Cham. https://doi.org/10.1007/978-3-319-17142-5_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-17142-5_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-17141-8

  • Online ISBN: 978-3-319-17142-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation