Dump 05.03.2022.09.23.am
Welcome to Core dump, the one stop for techies, in this episode, we have Dr bheemaiah talk about provable ML.
Gecko: so all NP complete problems are Z Complete, and hence tensorizable, based on the machine dreaming, so essentially ML problems are provable in tensorization, and complexity.
Dr Bheemaiah:
Supervised and unsupervised learning is encapsulated in neural architectures, tensorized to formally define the complexity, trainable and transfer learnt to solve all NP complete problems.
Dump 04.18.2021.18.43.PM
Monitor-Tabby: Welcome to CoreDump, the one stop for techies, in this dump, we speak to dr Bheemaiah, on the origins of CoreDump and the pedagogy of Infotainment.
Dr Bheemaiah: I started CoreDump, because I thought that code should be not only well commented, but include stories as well…