Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

One of the most powerful things I learned in topology was that functions can be viewed as sets of ordered pairs with the restriction that the first item in each ordered pair can only appear once.


Relations between sets are generalizations of functions, which is another way to realize that. I think this was taught in my first CS semester.

Also, in the context of automata theory, functions = deterministic and relations = nondeterministic.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: