Talk:Turing complete

This is wrong. --130.217.240.32 (talk) 04:17, 9 June 2009 (UTC)[reply]

It has been rewritten now. Nxavar (talk) 18:36, 7 April 2014 (UTC)[reply]

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)[reply]

Agree. I changed the article to reflect this. Thanks for the feedback! Nxavar (talk) 19:57, 29 October 2014 (UTC)[reply]

Turing-incomlete regular expressions...[change source]

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

Eptalon (talk) 19:27, 26 May 2024 (UTC)[reply]