Inaccessibility in decision procedures

MaRDI QIDQ2707537zbMATH OpenFDO

Authors Asaki Saito, Kunihiko Kaneko

Publication date 3 April 2001

zbMATH Keywords

halting setinaccessibilityMandelbrot setuniversal Turing machine

Mathematics Subject Classification ID

Recommendations

• Inaccessibility and undecidability in computation, geometry, and dynamical systems
• scientific article; zbMATH DE number 517066
• Complexity and real computation. Foreword by Richard M. Karp
• Unpredictability and undecidability in dynamical systems
• The halting problem is decidable on a set of asymptotic probability one

Cited in

(2)

• Inefficiencies on linking decisions
• Inaccessibility and undecidability in computation, geometry, and dynamical systems

This page was built for publication: Inaccessibility in decision procedures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2707537)