#112 - Jeffrey Scholz: Computatial Complexy + Optimization Theory, Math After University, Zero Knowledge Proofs
from Scraping Bits Hosted by DeGatchi
Dive into the cutting-edge world of computer science and mathematics with Scraping Bits by DeGatchi in Episode #112, featuring the brilliant Jeffrey Scholz. This episode is a must-listen for tech enthusiasts, aspiring computer scientists, and anyone passionate about the intersection of mathematics and technology. Key Topics Explored: Computational Complexity and Optimization Theory: Unravel the mysteries behind algorithm efficiency and problem-solving techniques that power modern computing. Mathematics Beyond University: Discover how to continue your mathematical journey post-graduation and apply advanced concepts in real-world scenarios. Zero Knowledge Proofs: Delve into this fascinating cryptographic concept that's revolutionizing blockchain technology and digital privacy. Tune in to Scraping Bits and stay ahead in the ever-evolving tech landscape! Follow Scraping Bits on Twitter: https://x.com/scrapingbits Your Host, DeGatchi: https://x.com/DeGatchi Guest Speaker: https://x.com/jeyffre Please support this podcast by checking out our sponsors: https://x.com/ComposableFin https://x.com/mevdotio https://x.com/0xPFL Keywords: mathematics, math, game theory, calculus, linear algebra, category theory, signal processing, statistics, probability, solo auditor, public auditing platforms, private audits, scalability, freedom, Scraping Bits podcast, blockchain technology, audit industry, flashbots, reverse engineering, cybersecurity, infosec, mev, mev bot, quant.
Embed this episode
No transcript yet.