What is...computational topology?

Поделиться
HTML-код
  • Опубликовано: 19 окт 2024

Комментарии • 8

  • @samhanna2349
    @samhanna2349 2 месяца назад +2

    I like the volume level currently. Now keep it this way so each time I watch new video of yours, I don't have to adjust the volume :)

    • @VisualMath
      @VisualMath  2 месяца назад +1

      Thanks for the feedback. I will see what I can do 😀

  • @YuXuanLow
    @YuXuanLow 2 месяца назад +3

    hey im a undergraduate mathematics student from Singapore and im really appreciative of these videos, thanks for making them!

    • @VisualMath
      @VisualMath  2 месяца назад +1

      Thanks for the feedback and greetings back to Singapore (love that place 😀)

  • @eternaldoorman5228
    @eternaldoorman5228 2 месяца назад +1

    3:08 The book _Proofs and Refutations_ by Imre Lakatos is actually a fairly historically accurate account of this, except the names of the people involved have been changed. Presumably to protect the innocent! But there are some notes relating the conjectures and definitions to various historical figures. However, it is rather a long time ago that I read it so I may be talking nonsense!

    • @VisualMath
      @VisualMath  2 месяца назад

      Interesting, I didn’t knew that, I will have a look. Thanks for sharing 👍

  • @peabrainiac6370
    @peabrainiac6370 2 месяца назад +1

    Just a small nitpick: a problem being in NP and co-NP doesn't mean that it is necessarily hard, does it? Since those classes both contain P. If it was also NP-hard that would of course be a different story, but as far as I know it's still unknown whether it is.

    • @VisualMath
      @VisualMath  2 месяца назад

      Right. I took the "NP and coNP" as an indication that something is hard, but yes, it could still be "easy" 😀