Well if you wrote a program in any Turing complete programming language, you wou... | Hacker News

Hacker News .hnnew | past | comments | ask | show | jobs | submit

		dinkumthinkum on March 29, 2013 \| parent \| context \| favorite \| on: Judge Says Mathematical Algorithms Can’t Be Patent... Well if you wrote a program in any Turing complete programming language, you would be done; how "trivial" it is doesn't matter. :)

greyfade on March 30, 2013 [–]

Indeed. By the Church-Turing Thesis, any program written for any Turing Machine (including any Turing-complete language) can be translated into the lambda calculus through a rote transformation.

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