Showing 1 - 7 of 7

1

Comparing algorithmic complexity of recursive and inductive algorithms
Burgin, Mark
Theoretical Computer Science. 317(1-3)

efficiency complexity dual complexity measure Kolmogorov complexity recursive algorithm turing machine
Academic journal
Save to List
2

Algorithmic complexity as a criterion of unsolvability
BURGIN, Mark
Complexity of algorithms and computationsTheoretical computer science. 383(2-3):244-259

Computer science Informatique Sciences exactes et tech... Exact sciences and techn... Sciences et techniques c... Sciences and techniques...
Conference
Save to List
3

Algorithmic complexity as a criterion of unsolvability
Mark Burgin
Theoretical Computer Science. 383:244-259

Recursive algorithmic co... Inductive Turing machine Super-recursive algorith... Kolmogorov complexity Algorithmic problem Inductive algorithmic co...
Academic journal
Save to List
4

Turing’s unpublished algorithm for normal numbers
Verónica Becher ; Santiago Figueira ; Rafael Eduardo Picchi
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

Computable absolutely no... Lebesgue measure FOS: Political science Mathematical proof 01 natural sciences Turing
Academic journal
Save to List
5

Algorithmic complexity of recursive and inductive algorithms
Mark Burgin
Theoretical Computer Science. 317:31-60

Inductive Turing machine Super-recursive algorith... Kolmogorov complexity Efficiency Complexity 0102 computer and inform...
Academic journal
Save to List
6

Nonlinear phenomena in spaces of algorithms
BURGIN, M
International journal of computer mathematics. 80(12):1449-1476

Monde World Mundo Computer science Informatique Mathematics
Academic journal
Save to List
7

Second-Level Algorithms, Superrecursivity, and Recovery Problem in Distributed Systems
Burgin, Mark ; Gupta, Bidyut
Theory of Computing Systems. May 2012 50(4):694-705

Academic journal
Save to List

Filter