Inductively Computable Hierarchies and Inductive Algorithmic Complexity

Mark Burgin
Mark Burgin
University of California, Los Angeles

Send Message

To: Author

Inductively Computable Hierarchies and Inductive Algorithmic Complexity

Article Fingerprint

ReserarchID

CSTITVJF6K

Inductively Computable Hierarchies and Inductive Algorithmic Complexity Banner

AI TAKEAWAY

Connecting with the Eternal Ground
  • English
  • Afrikaans
  • Albanian
  • Amharic
  • Arabic
  • Armenian
  • Azerbaijani
  • Basque
  • Belarusian
  • Bengali
  • Bosnian
  • Bulgarian
  • Catalan
  • Cebuano
  • Chichewa
  • Chinese (Simplified)
  • Chinese (Traditional)
  • Corsican
  • Croatian
  • Czech
  • Danish
  • Dutch
  • Esperanto
  • Estonian
  • Filipino
  • Finnish
  • French
  • Frisian
  • Galician
  • Georgian
  • German
  • Greek
  • Gujarati
  • Haitian Creole
  • Hausa
  • Hawaiian
  • Hebrew
  • Hindi
  • Hmong
  • Hungarian
  • Icelandic
  • Igbo
  • Indonesian
  • Irish
  • Italian
  • Japanese
  • Javanese
  • Kannada
  • Kazakh
  • Khmer
  • Korean
  • Kurdish (Kurmanji)
  • Kyrgyz
  • Lao
  • Latin
  • Latvian
  • Lithuanian
  • Luxembourgish
  • Macedonian
  • Malagasy
  • Malay
  • Malayalam
  • Maltese
  • Maori
  • Marathi
  • Mongolian
  • Myanmar (Burmese)
  • Nepali
  • Norwegian
  • Pashto
  • Persian
  • Polish
  • Portuguese
  • Punjabi
  • Romanian
  • Russian
  • Samoan
  • Scots Gaelic
  • Serbian
  • Sesotho
  • Shona
  • Sindhi
  • Sinhala
  • Slovak
  • Slovenian
  • Somali
  • Spanish
  • Sundanese
  • Swahili
  • Swedish
  • Tajik
  • Tamil
  • Telugu
  • Thai
  • Turkish
  • Ukrainian
  • Urdu
  • Uzbek
  • Vietnamese
  • Welsh
  • Xhosa
  • Yiddish
  • Yoruba
  • Zulu
Font Type
Font Size
Font Size
Bedground

Abstract

Induction is a prevalent cognitive method in science, while inductive computations are popular in many fields of computer and network technology. The most advanced mathematical model of inductive computations and reasoning is an inductive Turing machine, which is natural extension of the most widespread model of computing devices and computations -Turing machine. In comparison with Turing machines, inductive Turing machines represent the next step in the development of computer science providing better models for contemporary computers and computer networks. In this paper (Section 3), we study relations between inductively computable sets, inductively recognizable sets, inductively decidable sets and inductively computable functions. In addition (Section 4), we apply the obtained results to algorithmic information theory demonstrating how inductive Turing machines allow obtaining more information for essentially decreasing complexity in comparison with Turing machines.

References

13 Cites in Article
  1. Vieri Benci,C Bonanno,Stefano Galatolo,G Menconi,M Virgilio (2002). Dynamical systems and computable information.
  2. A Beros (2013). Learning Theory in the Arithmetical Hierarchy.
  3. M Burgin (1990). Generalized Kolmogorov Complexity and other Dual Complexity Measures.
  4. M Burgin (1999). Super-recursive Algorithms as a Tool for High Performance Computing.
  5. M Burgin (2004). Algorithmic Complexity of Recursive and Inductive Algorithms.
  6. M Burgin (2005). Super-recursive Algorithms.
  7. M Burgin (2006). Algorithmic Control in Concurrent Computations.
  8. M Burgin (2010). Theory of Information: Fundamentality, Diversity and Unification.
  9. M Burgin (2010). Algorithmic Complexity of Computational Problems.
  10. M Burgin (2010). Measuring Power of Algorithms, Computer Programs, and Information Automata.
  11. Mark Burgin,Cristian Calude,Elena Calude (2011). INDUCTIVE COMPLEXITY MEASURES FOR MATHEMATICAL PROBLEMS.
  12. Ulvi Yurtsever (2000). Quantum mechanics and algorithmic randomness.
  13. W Zurek (1990). Algorithmic information content, Church-Turing thesis, physical entropy, and Maxwell's demon.

Funding

No external funding was declared for this work.

Conflict of Interest

The authors declare no conflict of interest.

Ethical Approval

No ethics committee approval was required for this article type.

Data Availability

Not applicable for this article.

How to Cite This Article

Mark Burgin. 2016. \u201cInductively Computable Hierarchies and Inductive Algorithmic Complexity\u201d. Global Journal of Computer Science and Technology - H: Information & Technology GJCST-H Volume 16 (GJCST Volume 16 Issue H1).

Download Citation

Journal Specifications

Crossref Journal DOI 10.17406/gjcst

Print ISSN 0975-4350

e-ISSN 0975-4172

Keywords
Classification
F.1.3 F.2.2
Version of record

v1.2

Issue date
March 4, 2016

Language
en
Experiance in AR

Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.

Read in 3D

Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.

Article Matrices
Total Views: 7689
Total Downloads: 2005
2026 Trends
Related Research
Our website is actively being updated, and changes may occur frequently. Please clear your browser cache if needed. For feedback or error reporting, please email [email protected]

Request Access

Please fill out the form below to request access to this research paper. Your request will be reviewed by the editorial or author team.
X

Quote and Order Details

Contact Person

Invoice Address

Notes or Comments

This is the heading

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.

High-quality academic research articles on global topics and journals.

Inductively Computable Hierarchies and Inductive Algorithmic Complexity

Mark Burgin
Mark Burgin <p>University of California, Los Angeles</p>

Research Journals