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

grok =>

make fizzbuzz up to 20 only starting with these combinatory functions

let S = (x) => (y) => (z) => x(z)(y(z)); let K = (x) => (y) => x;

10 seconds later https://gist.github.com/1dolinski/93c2e193e5bc6fad9acfc33d71...



As far as I can tell, it mostly ignored the constraint (it came up with encodings for 1 and "true" in terms of S and K, but its "if" and "false" are the usual) and copy-pasted an existing lambda-calculus implementation.


You are taking a forklift to the gym. The goal isn't actually to move the weights from one place to another. The goal is the process.




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

Search: