Suchergebnisse - "Applications of computability and recursion theory"

COMPUTABLE TOPOLOGICAL GROUPS: Computable topological groups

Autoren: Koh, Heer Tern Melnikov, Alexander G. Ng, Keng Meng

Quelle: The Journal of Symbolic Logic. 90:188-220

Schlagwörter: Birkhoff-Kakutani theorem, Applications of computability and recursion theory, Polish groups, computable groups, FOS: Mathematics, 03D78 (Primary), Mathematics - Logic, 0102 computer and information sciences, right-c.e. Polish presentation, 0101 mathematics, Logic (math.LO), 01 natural sciences, topological groups

Dateibeschreibung: application/xml

Zugangs-URL: http://arxiv.org/abs/2209.04617
https://zbmath.org/8036441
https://doi.org/10.1017/jsl.2023.67

Halin’s infinite ray theorems: Complexity and reverse mathematics: Halin's infinite ray theorems: complexity and reverse mathematics

Autoren: James S. Barnes Jun Le Goh Richard A. Shore

Quelle: Journal of Mathematical Logic. 25

Schlagwörter: disjoint rays, Foundations of classical theories (including reverse mathematics), 01 natural sciences, Hierarchies of computability and definability, Halin's theorem, ubiquity, theorem of hyperarithmetic analysis, Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.), Infinite graphs, Applications of computability and recursion theory, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), reverse mathematics, 0101 mathematics, Second- and higher-order arithmetic and fragments, Paths and cycles

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/8031699
https://doi.org/10.1142/s0219061324500107

A computational study of a class of recursive inequalities

Autoren: Neri, Morenikeji Powell, Thomas

Quelle: Journal of Logic and Analysis. 15

Schlagwörter: Applications of functional analysis in optimization, convex analysis, mathematical programming, economics, subgradient methods, 0211 other engineering and technologies, rates of convergence, Mathematics - Logic, 02 engineering and technology, Functionals in proof theory, 01 natural sciences, Functional Analysis (math.FA), Mathematics - Functional Analysis, Applications of computability and recursion theory, proof mining, Optimization and Control (math.OC), Convergence and divergence of series and sequences, FOS: Mathematics, recursive inequalities, 0101 mathematics, Logic (math.LO), Mathematics - Optimization and Control, Fixed-point iterations

Dateibeschreibung: application/xml

Zugangs-URL: http://arxiv.org/abs/2207.14559

Kolmogorov-Loveland Randomness and Stochasticity: Kolmogorov-Loveland randomness and stochasticity

Autoren: Merkle, W. Miller, J.S. Nies, A. et al.

Weitere Verfasser: Merkle, W. Miller, J.S. Nies, A. et al.

Quelle: Lecture Notes in Computer Science ISBN: 9783540249986

Schlagwörter: Recursively (computably) enumerable sets and degrees, Effective Hausdorff dimension, Kolmogorov-Loveland random sequences, hyperimmune-free degrees, Logic, effective Hausdorff dimension, Kolmogorov complexity, Martin-Löf randomness, 0102 computer and information sciences, 01 natural sciences, Algorithmic randomness, Algorithmic information theory (Kolmogorov complexity, etc.), algorithmic randomness, stochastic sequences, Applications of computability and recursion theory, Kolmogorov-Loveland stochastic sequences, effective randomness, degrees of unsolvability, 0101 mathematics

Dateibeschreibung: application/xml

Zugangs-URL: https://dblp.uni-trier.de/db/conf/stacs/stacs2005.html#MerkleMNRS05
https://philpapers.org/rec/MERKRA-2
https://www.math.wisc.edu/~jmiller/Papers/kl.pdf
https://pennstate.pure.elsevier.com/en/publications/kolmogorov-loveland-randomness-and-stochasticity-2
https://link.springer.com/content/pdf/10.1007%2F978-3-540-31856-9_35.pdf
https://core.ac.uk/display/24658283

A Banach–Mazur computable but not Markov computable function on the computable real numbers: A Banach-Mazur computable but not Markov computable function on the computable real numbers

Autoren: Peter Hertling

Quelle: Lecture Notes in Computer Science ISBN: 9783540438649

Schlagwörter: Applications of computability and recursion theory, Computable functions on real numbers, Logic, Computable analysis, 0102 computer and information sciences, Computability theory, 0101 mathematics, Computable real numbers, 01 natural sciences, Constructive real analysis, Constructive and recursive analysis

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/2137209
https://doi.org/10.1016/j.apal.2004.08.001
https://link.springer.com/content/pdf/10.1007/3-540-45465-9_82.pdf
https://dblp.uni-trier.de/db/conf/icalp/icalp2002.html#Hertling02
https://rd.springer.com/chapter/10.1007/3-540-45465-9_82
https://link.springer.com/chapter/10.1007%2F3-540-45465-9_82

The Kolmogorov-Loveland Stochastic Sequences Are Not Closed under Selecting Subsequences: The Kolmogorov-Loveland stochastic sequences are not closed under selecting subsequences.

Autoren: Merkle, Wolfgang

Quelle: Lecture Notes in Computer Science ISBN: 9783540438649
J. Symbolic Logic 68, iss. 4 (2003), 1362-1376

Schlagwörter: Mises-Church random sequence, Combinatorial probability, Kolmogorov-Loveland random sequence, Applications of computability and recursion theory, random sequence, 0102 computer and information sciences, 0101 mathematics, 16. Peace & justice, 01 natural sciences, Algorithmic information theory (Kolmogorov complexity, etc.)

Dateibeschreibung: application/xml; application/pdf

Zugangs-URL: http://core.ac.uk/display/21974498
https://dblp.uni-trier.de/db/conf/icalp/icalp2002.html#Merkle02
https://rd.springer.com/chapter/10.1007/3-540-45465-9_34
https://link.springer.com/chapter/10.1007/3-540-45465-9_34
http://projecteuclid.org/euclid.jsl/1067620192

On the Construction of Effective Random Sets: On the construction of effectively random sets

Autoren: Merkle, Wolfgang Mihailović, Nenad

Quelle: Lecture Notes in Computer Science ISBN: 9783540440406
J. Symbolic Logic 69, iss. 3 (2004), 862-878

Schlagwörter: Recursively (computably) enumerable sets and degrees, Applications of computability and recursion theory, rec-random sequence, Martingales with discrete parameter, Martin-Löf randomness, diagonalization, computable martingale, 0102 computer and information sciences, 0101 mathematics, 16. Peace & justice, 01 natural sciences, Algorithmic information theory (Kolmogorov complexity, etc.)

Dateibeschreibung: application/xml; application/pdf

Zugangs-URL: https://zbmath.org/2199963
https://doi.org/10.2178/jsl/1096901772
http://core.ac.uk/display/24699827
https://link.springer.com/content/pdf/10.1007%2F3-540-45687-2_47.pdf
https://link.springer.com/chapter/10.1007/3-540-45687-2_47
https://rd.springer.com/chapter/10.1007/3-540-45687-2_47
https://dblp.uni-trier.de/db/conf/mfcs/mfcs2002.html#MerkleM02
http://projecteuclid.org/euclid.jsl/1096901772
https://philpapers.org/rec/MEROTC
https://projecteuclid.org/euclid.jsl/1096901772
https://dblp.uni-trier.de/db/journals/jsyml/jsyml69.html#MerkleM04
http://projecteuclid.org/euclid.jsl/1096901772

Randomness, Computability, and Density: Randomness, computability, and density

Autoren: Denis R. Hirschfeldt Rodney G. Downey André Nies

Quelle: Lecture Notes in Computer Science ISBN: 9783540416951

Schlagwörter: Applications of computability and recursion theory, Other degrees and reducibilities in computability and recursion theory, randomness, Kolmogorov complexity, 0102 computer and information sciences, 0101 mathematics, Solovay reducibility, 01 natural sciences, computably enumerable reals, algorithmic information theory, Algorithmic information theory (Kolmogorov complexity, etc.)

Dateibeschreibung: application/xml

Zugangs-URL: http://math.uchicago.edu/~drh/Papers/Papers/cereals.pdf
https://dblp.uni-trier.de/db/conf/stacs/stacs2001.html#DowneyHN01
https://link.springer.com/10.1007/3-540-44693-1_17
https://link.springer.com/chapter/10.1007%2F3-540-44693-1_17
https://rd.springer.com/chapter/10.1007/3-540-44693-1_17
https://epubs.siam.org/doi/abs/10.1137/S0097539700376937
https://locus.siam.org/doi/abs/10.1137/S0097539700376937
https://dblp.uni-trier.de/db/journals/siamcomp/siamcomp31.html#DowneyHN02

Randomness and Reductibility: Randomness and reducibility

Autoren: Rodney G. Downey Denis R. Hirschfeldt Geoff La Forte

Quelle: Lecture Notes in Computer Science ISBN: 9783540424963

Schlagwörter: Computer Networks and Communications, Applied Mathematics, Kolmogorov complexity, 0102 computer and information sciences, Algorithmic information theory, Solovay reducibility, 01 natural sciences, Algorithmic information theory (Kolmogorov complexity, etc.), Theoretical Computer Science, Relative randomness, Computational Theory and Mathematics, Applications of computability and recursion theory, Other degrees and reducibilities in computability and recursion theory, 0101 mathematics, Computably enumerable reals, domination

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/2099264
https://doi.org/10.1016/j.jcss.2003.07.004
https://dblp.uni-trier.de/db/journals/jcss/jcss68.html#DowneyHL04
https://www.sciencedirect.com/science/article/pii/S0022000003001314
https://core.ac.uk/display/82176402
https://link.springer.com/chapter/10.1007/3-540-44683-4_28
https://rd.springer.com/chapter/10.1007/3-540-44683-4_28

Monotonically Computable Real Numbers: Monotonically computable real numbers

Autoren: Romain Gengler Burchard von Braunmühl Xizhong Zheng et al.

Quelle: Combinatorics, Computability and Logic ISBN: 9781852335267

Schlagwörter: weakly computable real numbers, Applications of computability and recursion theory, monotonically computable real numbers, computable real numbers, hierarchy, semi-computable real numbers, Constructive real analysis, Constructive and recursive analysis

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/1747708
https://doi.org/10.1002/1521-3870(200204)48:3<459::aid-malq459>3.0.co;2-9

Learning via queries and oracles

Autoren: Stephan, Frank

Quelle: Annals of Pure and Applied Logic. 94:273-296

Schlagwörter: ddc:004, Recursively (computably) enumerable sets and degrees, queries to a non-recursive oracle, Logic, DATA processing & computer science, Learning and adaptive systems in artificial intelligence, Computational learning theory, Turing degrees, 0102 computer and information sciences, 01 natural sciences, logical queries, Applications of computability and recursion theory, inductive inference, Other degrees and reducibilities in computability and recursion theory, models of queries to a teacher, 0101 mathematics, query-inference degrees

Dateibeschreibung: application/xml; application/pdf

Zugangs-URL: https://publikationen.bibliothek.kit.edu/216895/2067
https://zbmath.org/1308090
https://doi.org/10.1016/s0168-0072(97)00077-8
https://publikationen.bibliothek.kit.edu/216895
https://dblp.uni-trier.de/db/conf/colt/colt1995.html#Stephan95
http://portal.acm.org/citation.cfm?doid=225298.225317
http://dblp.uni-trier.de/db/conf/colt/colt1995.html#Stephan95
https://dl.acm.org/doi/10.1145/225298.225317
https://www.sciencedirect.com/science/article/pii/S0168007297000778
https://dblp.uni-trier.de/db/journals/apal/apal94.html#Stephan98
https://www.sciencedirect.com/science/article/abs/pii/S0168007297000778
http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:swb:90-AAA2168956
https://publikationen.bibliothek.kit.edu/216895/2067
https://publikationen.bibliothek.kit.edu/216895
https://doi.org/10.5445/IR/216895

Machine learning of higher order programs: Machine learning of higher-order programs

Autoren: Sanjay Jain Ganesh Baliga John Case et al.

Quelle: Lecture Notes in Computer Science ISBN: 3540557075

Schlagwörter: recursive functions, 4. Education, Learning and adaptive systems in artificial intelligence, 0102 computer and information sciences, Models of computation (Turing machines, etc.), 16. Peace & justice, learning machine, 01 natural sciences, 7. Clean energy, computable functions, Applications of computability and recursion theory, learning power, higher- order programs, identification, 0101 mathematics, generator programs, limiting programs

Dateibeschreibung: application/xml

Zugangs-URL: http://www.comp.nus.edu.sg/~sanjay/paps/genex.pdf
https://zbmath.org/618227
https://doi.org/10.2307/2275402
https://comp.nus.edu.sg/~sanjay/paps/genex.pdf
https://www.cambridge.org/core/journals/journal-of-symbolic-logic/article/machine-learning-of-higherorder-programs/AA1E06BB3C1E588F5D03253B14E09BB9
https://dblp.uni-trier.de/db/journals/jsyml/jsyml59.html#BaligaCJS94
http://comp.nus.edu.sg/~sanjay/paps/genex.pdf
https://philpapers.org/rec/BALMLO
https://projecteuclid.org/euclid.jsl/1183744492
https://www.researchwithrowan.com/en/publications/machine-learning-of-higher-order-programs
https://link.springer.com/chapter/10.1007/BFb0023859
https://dblp.uni-trier.de/db/conf/lfcs/lfcs1992.html#BaligaCJS92
https://link.springer.com/content/pdf/10.1007%2FBFb0023859.pdf
https://rd.springer.com/chapter/10.1007/BFb0023859

Randomness, relativization and Turing degrees

Autoren: Nies, A. Stephan, F. Terwijn, S.A. et al.

Weitere Verfasser: Nies, A. Stephan, F. Terwijn, S.A. et al.

Quelle: J. Symbolic Logic 70, iss. 2 (2005), 515-535

Schlagwörter: 68Q30, Other Turing degree structures, randomness, Kolmogorov complexity, 0102 computer and information sciences, 16. Peace & justice, Schnorr randomness, Turing degree of a real, 01 natural sciences, Algorithmic information theory (Kolmogorov complexity, etc.), 28E15, 03D28, Applications of computability and recursion theory, 03D15, 03D80, 0101 mathematics

Dateibeschreibung: application/xml; application/pdf

Zugangs-URL: http://www.cs.auckland.ac.nz/~nies/papers/NST.pdf
https://zbmath.org/2247425
https://doi.org/10.2178/jsl/1120224726
https://dblp.uni-trier.de/db/journals/jsyml/jsyml70.html#NiesST05
http://projecteuclid.org/download/pdf_1/euclid.jsl/1120224726
https://www.jstor.org/stable/27588376
https://core.ac.uk/display/24385125
https://philpapers.org/rec/NIERRA-4
https://www.projecteuclid.org/euclid.jsl/1120224726
http://projecteuclid.org/euclid.jsl/1120224726

Computing the solution of the Korteweg-de Vries equation with arbitrary precision on Turing machines

Autoren: Ning Zhong Klaus Weihrauch

Quelle: Theoretical Computer Science. 332:337-366

Schlagwörter: KdV equation, Computability, 0102 computer and information sciences, 01 natural sciences, Theoretical Computer Science, Turing machine, Initial value problem, KdV equations (Korteweg-de Vries equations), type 2 theory of effectivity, Type 2 theory of effectivity, Applications of computability and recursion theory, Sobolev spaces, computable operator, 0101 mathematics, initial value problem, Constructive and recursive analysis, Computer Science(all)

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/2153191
https://doi.org/10.1016/j.tcs.2004.11.005
https://core.ac.uk/display/82292202
https://www.sciencedirect.com/science/article/pii/S030439750400773X
https://dblp.uni-trier.de/db/journals/tcs/tcs332.html#WeihrauchZ05
https://dl.acm.org/doi/10.1016/j.tcs.2004.11.005

Decidability in Analysis: Decidability in analysis

Autoren: Qing Zhou Weihao Hu

Quelle: Computing. 75:319-336

Schlagwörter: computable analysis, Decidability of theories and sets of sentences, almost decidable predicates of real variables, Applications of computability and recursion theory, computable reals, Euclidean geometries (general) and generalizations, 0102 computer and information sciences, 0101 mathematics, recursiveness, 01 natural sciences, Constructive real analysis, Constructive and recursive analysis

Dateibeschreibung: application/xml

Zugangs-URL: http://doi.org/10.1007/s00607-004-0107-x
https://link.springer.com/article/10.1007/s00607-004-0107-x
https://dblp.uni-trier.de/db/journals/computing/computing75.html#ZhouH05
https://doi.org/10.1007/s00607-004-0107-x

Computability Theory and Differential Geometry: Computability theory and differential geometry

Autoren: Soare, Robert I.

Quelle: Bull. Symbolic Logic 10, iss. 4 (2004), 457-486

Schlagwörter: Recursively (computably) enumerable sets and degrees, Manifolds of metrics (especially Riemannian), Applications of computability and recursion theory, Global geometric and topological methods (à la Gromov), differential geometric analysis on metric spaces, Turing machines and related notions, 0101 mathematics, 16. Peace & justice, 01 natural sciences

Dateibeschreibung: application/xml; application/pdf

Zugangs-URL: http://www.cs.uchicago.edu/~soare/Publications/geom.pdf
https://www.cambridge.org/core/journals/bulletin-of-symbolic-logic/article/computability-theory-and-differential-geometry/4743592E2DCEA0CD3AB8D20372F10C6D
https://dblp.uni-trier.de/db/journals/bsl/bsl10.html#Soare04
https://doi.org/10.2178/bsl/1102083758
http://www.people.cs.uchicago.edu/~soare/res/Geometry/geom.pdf
https://projecteuclid.org/journals/bulletin-of-symbolic-logic/volume-10/issue-4/Computability-theory-and-differential-geometry/10.2178/bsl/1102083758.full
http://www.cs.uchicago.edu/~soare/Publications/geom.pdf
http://projecteuclid.org/euclid.bsl/1102083758

There is no SW-complete c.e. real: There in no sw-complete c.e. real

Autoren: Yu, Liang Ding, Decheng

Quelle: J. Symbolic Logic 69, iss. 4 (2004), 1163-1170

Schlagwörter: 68Q30, Applications of computability and recursion theory, strongly weak truth table reducibility, Kolmogorov complexity, 03D80, 0102 computer and information sciences, random reals, 0101 mathematics, 16. Peace & justice, computably enumerable real numbers, 01 natural sciences, Algorithmic information theory (Kolmogorov complexity, etc.)

Dateibeschreibung: application/xml; application/pdf

Zugangs-URL: https://www.cambridge.org/core/journals/journal-of-symbolic-logic/article/there-is-no-swcomplete-ce-real/34CC601A852608AB71B5576A70C81578
https://philpapers.org/rec/LIATIN
https://dblp.uni-trier.de/db/journals/jsyml/jsyml69.html#DingY04
https://projecteuclid.org/journals/journal-of-symbolic-logic/volume-69/issue-4/There-is-no-SW-complete-ce-real/10.2178/jsl/1102022216.full
http://projecteuclid.org/euclid.jsl/1102022216

Is the Mandelbrot set computable?

Autoren: Peter Hertling

Quelle: Mathematical Logic Quarterly. 51:5-18

Schlagwörter: computability, Applications of computability and recursion theory, Mandelbrot set, 0102 computer and information sciences, Holomorphic families of dynamical systems, the Mandelbrot set, bifurcations, 0101 mathematics, 01 natural sciences, Constructive and recursive analysis

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/2134233
https://doi.org/10.1002/malq.200310124
https://www.fernuni-hagen.de/imperia/md/content/fakultaetfuermathematikundinformatik/forschung/berichte/bericht_298.pdf
https://dblp.uni-trier.de/db/journals/mlq/mlq51.html#Hertling05
https://ub-deposit.fernuni-hagen.de/receive/mir_mods_00000763
https://core.ac.uk/display/24726058

The Kolmogorov complexity of random reals

Autoren: Rodney G. Downey Decheng Ding Liang Yu

Quelle: Annals of Pure and Applied Logic. 129:163-180

Schlagwörter: Applications of computability and recursion theory, Logic, Kolmogorov complexity, 0102 computer and information sciences, random reals, 0101 mathematics, 01 natural sciences, Algorithmic information theory (Kolmogorov complexity, etc.)

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/2117330
https://doi.org/10.1016/j.apal.2004.01.006
https://dblp.uni-trier.de/db/journals/apal/apal129.html#YuDD04
http://math.nju.edu.cn/~yuliang/random.pdf
https://philpapers.org/rec/YUTKC
https://ims.nju.edu.cn/~yuliang/random.pdf
https://math.nju.edu.cn/~yuliang/random.pdf
https://www.sciencedirect.com/science/article/abs/pii/S0168007204000235

Every 2-random real is Kolmogorov random

Autoren: Miller, Joseph S.

Quelle: J. Symbolic Logic 69, iss. 3 (2004), 907-913

Schlagwörter: Kolmogorov random sequence, Applications of computability and recursion theory, Kolmogorov complexity, 0102 computer and information sciences, Martin-Löf random sequence, 0101 mathematics, 16. Peace & justice, Kolmogorov randomness, 01 natural sciences, Algorithmic information theory (Kolmogorov complexity, etc.)

Dateibeschreibung: application/xml; application/pdf

Zugangs-URL: https://zbmath.org/2199965
https://doi.org/10.2178/jsl/1096901774
http://core.ac.uk/display/24707380
https://doi.org/10.2178/jsl/1096901774
https://projecteuclid.org/journals/journal-of-symbolic-logic/volume-69/issue-3/Every-2-random-real-is-Kolmogorov-random/10.2178/jsl/1096901774.full
https://dblp.uni-trier.de/db/journals/jsyml/jsyml69.html#Miller04a
https://philpapers.org/rec/MILERR
https://www.cambridge.org/core/journals/journal-of-symbolic-logic/article/every-2random-real-is-kolmogorov-random/0C4950DA6A81098D0DA4A334251396BB
http://projecteuclid.org/euclid.jsl/1096901774