Talk:Schema (genetic algorithms)
Appearance
![]() | The contents of the Propagation of schema page were merged into Schema (genetic algorithms) on 10 January 2016. For the contribution history and old versions of the redirected page, please see its history; for the discussion at that location, see its talk page. |
This is the talk page for discussing improvements to the Schema (genetic algorithms) article. This is not a forum for general discussion of the article's subject. |
Article policies
|
Find sources: Google (books · news · scholar · free images · WP refs) · FENS · JSTOR · TWL |
![]() | This article is rated Stub-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||||||||||||
|
Merger of "Propagation of schema" article
[edit]- The following discussion is closed. Please do not modify it. Subsequent comments should be made in a new section. A summary of the conclusions reached follows.
- The result of this discussion was to merge. MartinZ02 (talk) 17:55, 10 January 2016 (UTC)
I suggest that the current stub article Propagation of schema (which is also proposed for movement to Wikitionary) should be merged into this one, so as to help define the concept of Schema in genetic algorithms better. Allens (talk) 15:15, 15 December 2011 (UTC)
- Seeing as how this stub should truthfully be given the title "Schema in artificial- or pseudo-genetic algorithms" which do you think better for propagation to merge with? Schema in artificial-genetic algorithms? or Schema in pseudo-genetic algorithms? or perhaps the term "algorithm" would be better understood with both labels artificial-genetic coding and pseudo-genetic coding are added to the definition of algorithm. Exactly the same as a computer will never be able to replicate the actions of animal brain, it can perform and carry out similar tasks, although the similar task is carried out by a distinct and unrelated method. There is a fundamental difference between being able to truly think, and being able to compute, the main difference is the latter can actually only execute previous explicit commands, which is not thinking. While having a defaultation hierarchy of executions for each command will certainly pass the Turing Test, that is all it does. The distinction actually exists in reality and only in philosophical thought exercises does that distinction get fuzzy. Only when peer-review is substituted for open-debate wherein public perception defines or constitutes the definition of open. - Dirtclustit (talk) 08:57, 23 June 2014 (UTC)
The discussion above is closed. Please do not modify it. Subsequent comments should be made on the appropriate discussion page. No further edits should be made to this discussion.