The Halting Probability in Von Neumann Architectures | Zendy

William B. Langdon | Zendy; Riccardo Poli | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

The Halting Probability in Von Neumann Architectures

Author(s) -

William B. Langdon,

Riccardo Poli

Publication year - 2006

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-33143-3

DOI - 10.1007/11729976_20

Subject(s) - usable , description number , fraction (chemistry) , turing , computer science , halting problem , convergence (economics) , von neumann architecture , genetic programming , turing machine , universal turing machine , theoretical computer science , algorithm , artificial intelligence , programming language , computation , chemistry , organic chemistry , world wide web , economics , economic growth

Theoretical models of Turing complete linear genetic programming (GP) programs suggest the fraction of halting programs is vanishingly small. Convergence results proved for an idealised machine, are tested on a small T7 computer with (finite) memory, conditional branches and jumps. Simulations confirm Turing complete fitness landscapes of this type hold at most a vanishingly small fraction of usable solutions.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research