Talk:Turing complete
This is wrong. --130.217.240.32 (talk) 04:17, 9 June 2009 (UTC)Reply
This is wrong. --130.217.240.32 (talk) 04:17, 9 June 2009 (UTC)
- It has been rewritten now. Nxavar (talk) 18:36, 7 April 2014 (UTC)
Well, its still wrong. A "turing complete" system needs to be able (potentially) to compute any problem regardless of available memory or resources. In the real world, hardware is never Turing Complete because resources are finite. Logicaloctopus (talk) 01:44, 12 October 2014 (UTC)
- Agree. I changed the article to reflect this. Thanks for the feedback! Nxavar (talk) 19:57, 29 October 2014 (UTC)
Turing-incomlete regular expressions...
The following comment was left below the article by an IP editor:
- The last paragraph is incorrect and makes no sense (the way I interpret it): First, a regex function like grep IS Turing complete since it can trivially replicate any pattern of inference rules in any language that can be expressed in a 1-dim'l tape with a finite number of symbols (or maybe not so trivially, but it trivially replicates a minimal complete T-machine, or ECA rule 110). Second, the "inclusion" of additional possibilities or capabilities could never make something NOT T-complete, more general functions are equally or more complete, not less
Content Disclaimer
Informasi ini disarikan dari Wikipedia dan disajikan kembali untuk tujuan edukasi. Konten tersedia di bawah lisensi CC BY-SA 3.0. Kami tidak bertanggung jawab atas ketidakakuratan data yang bersumber dari kontribusi publik tersebut.
- The information displayed on this website is sourced in part or in whole from Wikipedia and has been adapted for the purpose of restating it. We strive to provide accurate and relevant information, however:
- There is no guarantee of absolute accuracy. Wikipedia is an open, collaborative project that can be edited by anyone, so information is subject to change.
- It is not intended to constitute professional advice. The content displayed is for informational and educational purposes only. For important decisions (e.g., medical, legal, or financial), please consult a professional.
- Content copyright. Wikipedia is licensed under the Creative Commons Attribution-ShareAlike License (CC BY-SA). This means that content may be reused with appropriate attribution and shared under a similar license.
- Responsible use. Any risk arising from the use of information from this website is entirely the responsibility of the user.