Genetic Programming Using a Turing-Complete Representation

2005 ◽  
pp. 61-81 ◽  
Author(s):  
Taro Yabuki ◽  
Hitoshi Iba
Keyword(s):  
Genetic Programming ◽  
Evolutionary Computing ◽  
Recurrent Network ◽  
Complete Representation ◽  
Representation Scheme ◽  
Turing Complete ◽  
General Method

In this chapter, a new representation scheme for Genetic Programming (GP) is proposed. We need a Turing-complete representation for a general method of generating programs automatically; that is, the representation must be able to express any algorithms. Our representation is a recurrent network consisting of trees (RTN), which is proved to be Turing-complete. In addition, it is applied to the tasks of generating language classifiers and a bit reverser. As a result, RTN is shown to be usable in evolutionary computing.

scholarly journals Balancing Accuracy and Parsimony in Genetic Programming

1995 ◽  
Vol 3 (1) ◽  
pp. 17-38 ◽  
Author(s):  
Byoung-Tak Zhang ◽  
Heinz Mühlenbein
Keyword(s):  
Genetic Programming ◽  
Adaptive Learning ◽  
Model Comparison ◽  
Model Complexity ◽  
Underlying Structure ◽  
Network Synthesis ◽  
Inference Problem ◽  
Bayesian Model Comparison ◽  
Fundamental Relationship ◽  
Representation Scheme

Genetic programming is distinguished from other evolutionary algorithms in that it uses tree representations of variable size instead of linear strings of fixed length. The flexible representation scheme is very important because it allows the underlying structure of the data to be discovered automatically. One primary difficulty, however, is that the solutions may grow too big without any improvement of their generalization ability. In this article we investigate the fundamental relationship between the performance and complexity of the evolved structures. The essence of the parsimony problem is demonstrated empirically by analyzing error landscapes of programs evolved for neural network synthesis. We consider genetic programming as a statistical inference problem and apply the Bayesian model-comparison framework to introduce a class of fitness functions with error and complexity terms. An adaptive learning method is then presented that automatically balances the model-complexity factor to evolve parsimonious programs without losing the diversity of the population needed for achieving the desired training accuracy. The effectiveness of this approach is empirically shown on the induction of sigma-pi neural networks for solving a real-world medical diagnosis problem as well as benchmark tasks.

scholarly journals Polynomial Analogue of Gandy’s Fixed Point Theorem

Mathematics ◽  
2021 ◽  
Vol 9 (17) ◽  
pp. 2102
Author(s):  
Sergey Goncharov ◽  
Andrey Nechesov
Keyword(s):  
Fixed Point ◽  
Fixed Point Theorem ◽  
Point Theorem ◽  
Data Types ◽  
Computable Set ◽  
New Type ◽  
Special Operator ◽  
Single Formula ◽  
Turing Complete ◽  
General Method

The paper suggests a general method for proving the fact whether a certain set is p-computable or not. The method is based on a polynomial analogue of the classical Gandy’s fixed point theorem. Classical Gandy’s theorem deals with the extension of a predicate through a special operator ΓΦ(x)Ω∗ and states that the smallest fixed point of this operator is a Σ-set. Our work uses a new type of operator which extends predicates so that the smallest fixed point remains a p-computable set. Moreover, if in the classical Gandy’s fixed point theorem, the special Σ-formula Φ(x¯) is used in the construction of the operator, then a new operator uses special generating families of formulas instead of a single formula. This work opens up broad prospects for the application of the polynomial analogue of Gandy’s theorem in the construction of new types of terms and formulas, in the construction of new data types and programs of polynomial computational complexity in Turing complete languages.

scholarly journals Evolving continuous optimisers from scratch

2021 ◽  
Author(s):  
Michael A. Lones
Keyword(s):  
Genetic Programming ◽  
Search Space ◽  
General Purpose ◽  
Problem Types ◽  
Broad Variety ◽  
Turing Complete

AbstractThis work uses genetic programming to explore the space of continuous optimisers, with the goal of discovering novel ways of doing optimisation. In order to keep the search space broad, the optimisers are evolved from scratch using Push, a Turing-complete, general-purpose, language. The resulting optimisers are found to be diverse, and explore their optimisation landscapes using a variety of interesting, and sometimes unusual, strategies. Significantly, when applied to problems that were not seen during training, many of the evolved optimisers generalise well, and often outperform existing optimisers. This supports the idea that novel and effective forms of optimisation can be discovered in an automated manner. This paper also shows that pools of evolved optimisers can be hybridised to further increase their generality, leading to optimisers that perform robustly over a broad variety of problem types and sizes.

A General Method for Spectrometer Design in the Scoff Approximation

1976 ◽  
Vol 34 ◽  
pp. 538-539
Author(s):  
J. R. Fields
Keyword(s):  
Electron Microscope ◽  
Transmission Electron Microscope ◽  
Energy Analysis ◽  
Incident Beam ◽  
Scanning Transmission Electron Microscope ◽  
Chemical Identification ◽  
Scanning Transmission Electron ◽  
Transmission Electron ◽  
Scanning Transmission ◽  
General Method

The energy analysis of electrons scattered by a specimen in a scanning transmission electron microscope can improve contrast as well as aid in chemical identification. In so far as energy analysis is useful, one would like to be able to design a spectrometer which is tailored to his particular needs. In our own case, we require a spectrometer which will accept a parallel incident beam and which will focus the electrons in both the median and perpendicular planes. In addition, since we intend to follow the spectrometer by a detector array rather than a single energy selecting slit, we need as great a dispersion as possible. Therefore, we would like to follow our spectrometer by a magnifying lens. Consequently, the line along which electrons of varying energy are dispersed must be normal to the direction of the central ray at the spectrometer exit.

Phase behavior of cationic and anionic surfactants at low concentrations

1992 ◽  
Vol 50 (1) ◽  
pp. 694-695
Author(s):  
E. Naranjo
Keyword(s):  
Phase Behavior ◽  
Structural Characterization ◽  
Dynamic Systems ◽  
Anionic Surfactants ◽  
Intermolecular Forces ◽  
Stable Form ◽  
Surfactant Mixtures ◽  
Low Concentrations ◽  
Cationic And Anionic Surfactants ◽  
General Method

Equilibrium vesicles, those which are the stable form of aggregation and form spontaneously on mixing surfactant with water, have never been demonstrated in single component bilayers and only rarely in lipid or surfactant mixtures. Designing a simple and general method for producing spontaneous and stable vesicles depends on a better understanding of the thermodynamics of aggregation, the interplay of intermolecular forces in surfactants, and an efficient way of doing structural characterization in dynamic systems.

Lateral inhibition in a recurrent network

1997 ◽  
Author(s):  
William T. Farrar ◽  
Guy C. Van Orden
Keyword(s):  
Lateral Inhibition ◽  
Recurrent Network

Caricaturing as a general method to improve poor face recognition: Evidence from low-resolution images, other-race faces, and older adults.

2019 ◽  
Vol 25 (2) ◽  
pp. 256-279 ◽  
Author(s):  
Amy Dawel ◽  
Tsz Ying Wong ◽  
Jodie McMorrow ◽  
Callin Ivanovici ◽  
Xuming He ◽  
...  
Keyword(s):  
Older Adults ◽  
Face Recognition ◽  
Low Resolution ◽  
General Method ◽  
Low Resolution Images

Morphosemantic Analysis and Translation of Medical Compound Terms

1991 ◽  
Vol 30 (01) ◽  
pp. 30-35 ◽  
Author(s):  
P. Dujols ◽  
P. Aubas ◽  
C. Baylon ◽  
F. Grémy
Keyword(s):  
Medical Terms ◽  
General Method

This paper describes an automatic procedure for morphosemantic analysis and translation of compound medical terms. This analysis is of interest for the automatic indexation of medical discharge reports and summaries. Since words with the suffix -osis may have many different semantic interpretations, such -osis forms are taken as examples for a general method that avoids the difficulties in interpreting medical terms as reported in other studies.

Sign in / Sign up

Export Citation Format

Share Document