fɔːɹ ɛɡzˈæmpəl, ɐ sˈɛt ʌv ɹᵻvˈɜːsᵻbəl ɡˈeɪts ɪz kˈɔːld fˈʌŋkʃənəli kəmplˈiːt, ɪf ɪt kæn ɛkspɹˈɛs ˈɛvɹi ɹᵻvˈɜːsᵻbəl ˈɑːpɚɹˌeɪɾɚ.
For example, a set of reversible gates is called functionally complete, if it can express every reversible operator.