Hacker News new | past | comments | ask | show | jobs | submit login

Solvable if the compiler can initiate an intelligent conversation. Like, "What you said is ambiguous. Did you mean? ..."



That would be awesome! Perhaps we could have an animated character have that conversation with us... how about an intelligent paperclip or something?!

Wouldn't programming become so cool!?!!


I hope in 20 years we look back and say 'duh, of course'. And yeah, it would be so cool.


I feel like I should introduce you to Agda2: http://wiki.portal.chalmers.se/agda/pmwiki.php

You write something, Agda2 checks it and says that you forget something, you wrote an inconsistent code or you wrote ambiguous code (it is possible to hide some parts of code).


Do you envision search engines becoming Turing complete at some point in time? ;-)


I don't know why you ask that. Are you suggesting that it is difficult to determine whether a statement is ambiguous or not?


It was half-joke, actually -- but there is point to it, to some extent.

I was referring to the fact that (web) search engines often display `Did you mean X?' when query string contains a symbol they don't know. Also, in a way, a search engine does interpret the query as a (simplistic) program of sorts. And, once in a while, it'd be handy to be able to issue query to search engines in a more powerful query language... So I saw a weak analogy there, between search engine and a compiler with the `Did you mean X?' feature.


You appear to be confusing "Turing complete" and the "Turing test". These two concepts are only related by the man which proposed them. They are quite separate classes of concept.




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

Search: