Google gives everyone machine learning superpowers with TensorFlow 1.0 / extremetech

@Michael was browsing your new thesis. on p2-3 you say Karakostas, Lipton, Viglas (2003) connect FSM intersection nonemptiness problem to SAT/ ETH. just got their paper & was skimming it. they seem to mention neither SAT/ ETH directly in their paper...? maybe more is in Fernau, Krebs (2016)?

@vzn Hi VZN, thank you for the message. I believe that you found a mistake or typo. Thank you very much. :)

@vzn Karakostas, Lipton, Viglas (2003) do not directly show that solving DFA intersection non-emptiness in n^{o(k)} time implies ETH is false. However, Fernau and Krebs (2016) do show this.

Will add your correction to my website. :)

@vzn Hi vzn, you have been added here: michaelwehar.com/additional.html

@vzn Please feel free to ask any more questions. I really hope that you do. Thank you. :)