Suchergebnisse - "Super-recursive algorithm"

Comparing algorithmic complexity of recursive and inductive algorithms

Autoren: Burgin, Mark

Quelle: Theoretical Computer Science. 317(1-3)

Schlagwörter: efficiency, complexity, dual complexity measure, Kolmogorov complexity, recursive algorithm, turing machine, super-recursive algorithm, inductive turing machine

Dateibeschreibung: application/pdf

Zugangs-URL: https://escholarship.org/uc/item/0960w3cj
https://escholarship.org/content/qt0960w3cj/qt0960w3cj.pdf

Algorithmic complexity as a criterion of unsolvability

Autoren: Mark Burgin

Quelle: Theoretical Computer Science. 383:244-259

Schlagwörter: Recursive algorithmic complexity, Inductive Turing machine, Super-recursive algorithm, Kolmogorov complexity, Algorithmic problem, Inductive algorithmic complexity, Decidability, 0102 computer and information sciences, 0101 mathematics, 01 natural sciences, Theoretical Computer Science, Computer Science(all)

Zugangs-URL: https://core.ac.uk/display/82482743
https://www.sciencedirect.com/science/article/pii/S0304397507003209
https://dblp.uni-trier.de/db/journals/tcs/tcs383.html#Burgin07

Turing’s unpublished algorithm for normal numbers

Autoren: Verónica Becher Santiago Figueira Rafael Eduardo Picchi

Quelle: Theor Comput Sci 2007;377(1-3):126-138
Biblioteca Digital (UBA-FCEN)
Universidad Nacional de Buenos Aires. Facultad de Ciencias Exactas y Naturales
instacron:UBA-FCEN

Schlagwörter: Computable absolutely normal numbers, Lebesgue measure, FOS: Political science, Mathematical proof, 01 natural sciences, Turing, Computable construction, Error correction, Floating-Point Arithmetic in Scientific Computation, Theorem proving, Political science, Universal Turing machine, Ecology, Text Compression and Indexing Algorithms, Super-recursive algorithm, Discrete mathematics, Minor (academic), Algorithm for normal numbers, Programming language, Algorithm, Normal numbers, Lemma (botany), Computational Theory and Mathematics, Physical Sciences, Set theory, Manuscripts, Algorithms, Computer Science(all), Geometry, Set (abstract data type), FOS: Law, Turing machines, 0102 computer and information sciences, Poaceae, Theoretical Computer Science, Turing machine, Turing's unpublished manuscript, Computational Complexity and Algorithmic Information Theory, Number theory, Artificial Intelligence, FOS: Mathematics, 0101 mathematics, Biology, Computability, Computer science, FOS: Biological sciences, Computer Science, Computation, Law, Mathematics

Dateibeschreibung: application/pdf

Zugangs-URL: http://hdl.handle.net/20.500.12110/paper_03043975_v377_n1-3_p126_Becher

Algorithmic complexity of recursive and inductive algorithms

Autoren: Mark Burgin

Quelle: Theoretical Computer Science. 317:31-60

Schlagwörter: Inductive Turing machine, Super-recursive algorithm, Kolmogorov complexity, Efficiency, Complexity, 0102 computer and information sciences, 02 engineering and technology, Models of computation (Turing machines, etc.), 01 natural sciences, Algorithmic information theory (Kolmogorov complexity, etc.), Theoretical Computer Science, Turing machine, Recursive algorithm, 0202 electrical engineering, electronic engineering, information engineering, Dual complexity measure, Computer Science(all)

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/2081196
https://doi.org/10.1016/j.tcs.2003.12.003