2014/08/13 by Rasoul Ramezanian, Ramezanian, Rasoul
Biochemistry, Genetics and Molecular Biology · Computer Science · #68Q10 #Computability, Logic, AI Algorithms #DNA and Biological Computing #Evolutionary Algorithms and Applications #F.1.1 #F.1.2 #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #Logic in Computer Science (cs.LO) #acm:68Q10 #cs.FL #cs.LO #msc:68Q10
paper · pdf · doi:10.48550/arxiv.1408.2930
This paper has been withdrawn by the author due to crucial errors in theorems 4.6 and 5.2 and definition 4.2
openalex publication_date 2014/08/13 · arxiv created 2015/11/15 · arxiv updated 2015/11/17 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In contrast to other constructivist schools, for Brouwer, the notion of "constructive object" is not restricted to be presented as `words' in some finite alphabet of symbols, and choice sequences which are non-predetermined and unfinished objects are legitimate constructive objects. In this way, Brouwer's constructivism goes beyond Turing computability. Further, in 1999, the term hypercomputation was introduced by J. Copeland. Hypercomputation refers to models of computation which go beyond Church-Turing thesis. In this paper, we propose a hypercomputation called persistently evolutionary Turing machines based on Brouwer's notion of being constructive.