Inductively Computable Hierarchies and Inductive Algorithmic Complexity
Keywords:
algorithmic information theory, inductive computation, turing machine, inductive turing machine, kolmogorov complexity, inductive computability, induc
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
Downloads
- Article PDF
- TEI XML Kaleidoscope (download in zip)* (Beta by AI)
- Lens* NISO JATS XML (Beta by AI)
- HTML Kaleidoscope* (Beta by AI)
- DBK XML Kaleidoscope (download in zip)* (Beta by AI)
- LaTeX pdf Kaleidoscope* (Beta by AI)
- EPUB Kaleidoscope* (Beta by AI)
- MD Kaleidoscope* (Beta by AI)
- FO Kaleidoscope* (Beta by AI)
- BIB Kaleidoscope* (Beta by AI)
- LaTeX Kaleidoscope* (Beta by AI)
How to Cite
Published
2016-01-15
Issue
Section
License
Copyright (c) 2016 Authors and Global Journals Private Limited
This work is licensed under a Creative Commons Attribution 4.0 International License.