Erkennen mit leerem Stack ist oft einfacher
Released Thursday, 5th January 2012
Good episode? Give it some love!
Erkennen mit leerem Stack ist oft einfacher
Erkennen mit leerem Stack ist oft einfacher
Thursday, 5th January 2012
Good episode? Give it some love!
Rate Episode
Rate
From The Podcast
Theoretische Informatik I (WS 2011/12) - Created with tele-TASK - more than video! Powered by Hasso Plattner Institute (HPI).
Die Theoretische Informatik beschäftigt sich mit den grundlegenden Fragestellungen der Informatik. Hierzu werden Computer- und Automatenmodelle idealisiert und mathematisch untersucht.Join Podchaser to...
- Rate podcasts and episodes
- Follow podcasts and creators
- Create podcast and episode lists
- & much more
Episode Tags
Do you host or manage this podcast?
Claim and edit this page to your liking.
,Claim and edit this page to your liking.
Unlock more with Podchaser Pro
- Audience Insights
- Contact Information
- Demographics
- Charts
- Sponsor History
- and More!
- Account
- Register
- Log In
- Find Friends
- Resources
- Help Center
- Blog
- API
Podchaser is the ultimate destination for podcast data, search, and discovery. Learn More
- © 2024 Podchaser, Inc.
- Privacy Policy
- Terms of Service
- Contact Us