Descriptive complexity of real computation and probabilistic independence logic

@article{Hannula2020DescriptiveCO,
  title={Descriptive complexity of real computation and probabilistic independence logic},
  author={Miika Hannula and Juha Kontinen and Jan Van den Bussche and Jonni Virtema},
  journal={Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science},
  year={2020}
}
  • Miika Hannula, Juha Kontinen, +1 author Jonni Virtema
  • Published 2020
  • Computer Science, Mathematics
  • Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science
  • We introduce a novel variant of BSS machines called Separate Branching BSS machines (S-BSS in short) and develop a Fagin-type logical characterisation for languages decidable in nondeterministic polynomial time by S-BSS machines. We show that NP on S-BSS machines is strictly included in NP on BSS machines and that every NP language on S-BSS machines is a countable disjoint union of closed sets in the usual topology of Rn. Moreover, we establish that on Boolean inputs NP on S-BSS machines… CONTINUE READING

    References

    Publications referenced by this paper.
    SHOWING 1-2 OF 2 REFERENCES

    Descriptive complexity theory over the real numbers

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    Probabilistic Team Semantics. In Foundations of Information and Knowledge Systems - 10th International Symposium, FoIKS 2018

    • Arnaud Durand, Miika Hannula, Juha Kontinen, Arne Meier, Jonni Virtema
    • 2018
    VIEW 7 EXCERPTS
    HIGHLY INFLUENTIAL