Reverse HillclimbingGenetic Algorithms and the Busy Beaver Problem

No abstract is available for this paper.

• Publication year

  1993

• Venue

  International Conference on Genetic Algorithms

• Publication date

  1993-06-01

• Fields of study

  Mathematics, Computer Science

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Busy beaver competition and Collatz-like problems

  1993cited by this paper
• A bound on the shift function in terms of the Busy Beaver function

  1992cited by this paper
• Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence

  1992cited by this paper
• Bit-Climbing, Representational Bias, and Test Suite Design

  1991cited by this paper
• Introduction to Languages and the Theory of Computation" 3rd Ed

  1991cited by this paper
• Turing's World 3.0 : an introduction to computability theory : for the Macintosh

  1991cited by this paper
• GA-Easy Does Not Imply Steepest-Ascent Optimizable

  1991cited by this paper
• Attacking the Busy Beaver 5

  1990cited by this paper
• The complex behavior of simple machines

  1990cited by this paper
• Lectures In The Sciences Of Complexity

  1989cited by this paper
• The busy beaver game and the meaning of life

  1988cited by this paper
• Castor quadruplorum

  1988cited by this paper
• Genetic Algorithms in Search Optimization and Machine Learning

  1988cited by this paper
• A connectionist machine for genetic hillclimbing

  1987cited by this paper
• Computing the Busy Beaver Function

  1987cited by this paper
• Computation and Automata

  1984cited by this paper
• The determination of the value of Rado’s noncomputable function Σ() for four-state Turing machines

  1983cited by this paper
• Busy Beaver Sets: Characterizations and Applications

  1982cited by this paper
• The busy beaver on a one-way infinite tape

  1982cited by this paper
• On the relation between descriptional complexity and algorithmic probability

  1981cited by this paper
• Busy beaver sets and the degrees of unsolvability

  1981cited by this paper
• Retraceability, Repleteness and Busy Beaver Sets

  1981cited by this paper
• The Busy Beaver Method

  1980cited by this paper
• Some rapidly growing functions

  1980cited by this paper
• Quantitative and Qualitative Information in Computations

  1980cited by this paper
• Atlanta fiber system experiment: Overview

  1978cited by this paper
• On the Simplicity of Busy Beaver Sets

  1978cited by this paper
• Several results in program size complexity

  1977cited by this paper
• Introduction to Computability

  1977cited by this paper
• Elements of Recursion Theory

  1977cited by this paper
• On a problem in the collective behavior of automata

  1976cited by this paper
• Noncomplex sequences: characterizations and examples

  1976cited by this paper
• Randomness and Mathematical Proof

  1975cited by this paper
• Information-Theoretic Computational Complexity

  1974cited by this paper
• Information-Theoretic Limitations of Formal Systems

  1974cited by this paper
• Further Results on the Problem of Finding Minimal Length Programs for Decision Tables

  1974cited by this paper
• Recursive Undecidability — An Exposition

  1974cited by this paper
• Computer recreations

  1973cited by this paper
• Subclasses of Turing machines reducible to finite automata

  1972cited by this paper
• New Results for Rado's Sigma Function for Binary Turing Machines

  1972cited by this paper
• Untersuchungen über haltende Programme für Turing-Maschinen mit 2 Zeichen und bis zu 5 Befehlen

  1972cited by this paper
• Partitioning Integers in n Dimensions

  1970cited by this paper
• On the difficulty of computations

  1970cited by this paper
• On the Problem of Finding Minimal Programs for Tables

  1969cited by this paper
• Formal languages and their relation to automata

  1969cited by this paper
• An Uncompletable Function

  1968cited by this paper
• Algorithmen, rekursive Funktionen und formale Sprachen

  1968cited by this paper
• Computation: Finite and Infinite Machines

  1967cited by this paper
• Review: Tibor Rado, On a Simple Source for Non-Computable Functions

  1967cited by this paper
• The Conjectured Highest Scoring Machines for Rado's Σ(k) for the Value k = 4

  1966cited by this paper
• Computer Studies of Turing Machine Problems

  1965cited by this paper
• Solutions of restricted cases of the halting problem applied to the determination of particular values of a non-computable function

  1965cited by this paper
• Tomorrow's Math.

  1964cited by this paper
• Words in the History of a Turing Machine with a Fixed Input

  1963cited by this paper
• On non-computable functions

  1962cited by this paper
• Automata and finite automata

  1960cited by this paper
• A Variant to Turing's Theory of Computing Machines

  1957cited by this paper
• Introduction to Metamathematics

  1952cited by this paper
• On Computable Numbers, with an Application to the Entscheidungsproblem.

  1937cited by this paper
• Simulation of biological cells by systems composed of string-processing finite automata

  1899cited by this paper
• Simulation of a Turing machine on a digital computer

  1899cited by this paper

• Quantifying and Visualizing the Sharpness of Attraction Basins in Neural Network Error Landscapes

  2023cites this paper
• New solutions to Cooke triplet problem via analysis of attraction basins

  2023cites this paper
• Flipping the switch on local exploration: Genetic Algorithms with Reversals

  2022cites this paper
• Analysis of Busy Beaver

  2015cites this paper
• Recent developments of hyperspectral imaging systems and their applications in detecting quality attributes of red meats: A review

  2014cites this paper
• The Busy Beaver

  2011cites this paper
• Bibliography on the Busy Beaver Problem

  2010cites this paper
• EasyAnalyzer: An Object-Oriented Framework for the Experimental Analysis of Stochastic Local Search Algorithms

  2007cites this paper
• Evolving petri nets to represent metabolic pathways

  2005cites this paper
• Evolutionary Turing Machines: The Quest for Busy Beavers

  2005influential citation
• Empirical modeling and analysis of local search algorithms for the job-shop scheduling problem

  2003cites this paper
• Estudo das interacções entre evolução e aprendizagem em ambientes de computação evolucionária

  2002cites this paper
• Understanding the role of learning in the evolution of busy beavers: a comparison between the baldwin effect and a Lamarckian strategy

  2001cites this paper
• A single queen single worker honey–bees approach to 3-SAT

  2001cites this paper
• The Influence of Learning in the Evolution of Busy Beavers

  2001cites this paper
• Simulated Evolutionary Optimization and Local Search: Introduction and Application to Tree Search

  2001cites this paper
• Too busy to learn [individual learning interaction with evolutionary algorithm in Busy Beaver problem]

  2000cites this paper
• Busy Beaver - An Evolutionary Approach

  1999cites this paper
• Stochastic reverse hill climbing and iterated local search

  1999cites this paper
• Busy Beaver - The Influence of Representation

  1999cites this paper
• Showing the Way: A Review of the Second Edition of Holland's Adaptation in Natural and Artificial Systems

  1998cites this paper
• A Theoretical and Empirical Analysis of -ary Landscapes for Genetic Algorithms a Theoretical and Empirical Analysis of -ary Landscapes for Genetic Algorithms

  1997cites this paper
• Crossover , Macromutation , and Population-Based Search

  1995cites this paper
• Genetic Algorithms and Heuristic Search

  1995cites this paper
• Adaptation and the Modular Design of Organisms

  1995cites this paper
• Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms

  1995cites this paper
• Genetic Algorithms, Problem Difficulty, and the Modality of Fitness Landscapes

  1995cites this paper
• Genetic Algorithm Di culty and the Modality ofFitness

  1994cites this paper
• Genetic Algorithm Difficulty and the Modality of Fitness Landscapes

  1994cites this paper
• Long Path Problems

  1994cites this paper
• A Model of Landscapes

  1994cites this paper