Do Regex Dream of Turing Completeness?
Offered By: Ruby Central via YouTube
Course Description
Overview
Explore the surprising capabilities of Regular Expressions in this 29-minute conference talk from RubyConf 2021. Delve into the world of pattern matching and text replacement, pushing the boundaries of what regex can accomplish. Discover how to implement Conway's Game of Life using only regex, and learn about the concept of Turing Completeness in relation to regular expressions. Gain insights into unusual regex techniques, programmatically generating complex regexes with Ruby, and expand your understanding of regex's potential. Join Daniel Magliola on an exciting journey that challenges conventional notions of regex limitations and reveals their unexpected power in programming.
Syllabus
RubyConf 2021 - Do regex dream of Turing Completeness? by Daniel Magliola
Taught by
Ruby Central
Related Courses
Design of Computer ProgramsStanford University via Udacity Programming Languages
University of Virginia via Udacity Data Structures and Performance
University of California, San Diego via Coursera Introducción a Data Science: Programación Estadística con R
Universidad Nacional Autónoma de México via Coursera Applied Text Mining in Python
University of Michigan via Coursera