Last Updated:2025/11/20

The untyped lambda calculus is functionally complete because it can compute any recursive function.

See correct answer

The untyped lambda calculus is functionally complete because it can compute any recursive function.

音声機能が動作しない場合はこちらをご確認ください
Edit Histories(0)
Source Sentence

無型ラムダ計算は任意の再帰関数を計算できるため、関数的に完全である。

Sentence quizzes to help you learn to read

Edit Histories(0)

Login / Sign up

 

Download the app!
DiQt

DiQt

Free

★★★★★★★★★★