Search Results - Applications of computability and recursion theory
-
1
Authors:
Source: The Journal of Symbolic Logic. 90:188-220
Subject Terms: 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
File Description: application/xml
-
2
Authors: Soare, Robert I.
Source: Bull. Symbolic Logic 10, iss. 4 (2004), 457-486
Subject Terms: 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
File Description: application/xml; application/pdf
Access 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 -
3
Authors:
Source: Archive for Mathematical Logic. 43:991-1008
Subject Terms: Applications of computability and recursion theory, sharp filters, recursive analysis, Convergence in general topology (sequences, filters, limits, convergence spaces, nets, etc.), recursive topology, 0101 mathematics, 01 natural sciences, Theory of numerations, effectively presented structures, \(\Pi^0_1\) tree of shadow points
File Description: application/xml
-
4
-
5
Authors: James H. Schmerl
Source: Mathematical Logic Quarterly. 44:515-521
Subject Terms: Recursively (computably) enumerable sets and degrees, computably set, Applications of computability and recursion theory, Other combinatorial number theory, difference set, c.e. set, 0102 computer and information sciences, 0101 mathematics, computable enumerable set, 01 natural sciences
File Description: application/xml
-
6
Authors:
Source: Journal of Logic and Analysis. 15
Subject Terms: 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
File Description: application/xml
Access URL: http://arxiv.org/abs/2207.14559
-
7
Authors:
Source: Journal of Mathematical Logic. 25
Subject Terms: 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
File Description: application/xml
-
8
Authors:
Source: Lecture Notes in Computer Science ISBN: 9783540416951
Subject Terms: 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.)
File Description: application/xml
Access 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 -
9
Authors:
Source: Complexity. 1:40-55
Subject Terms: Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations, Applications of computability and recursion theory, undecidability, 05 social sciences, Other degrees and reducibilities in computability and recursion theory, Undecidability and degrees of sets of sentences, survey, 0501 psychology and cognitive sciences, 06 humanities and the arts, incompleteness, 0603 philosophy, ethics and religion
File Description: application/xml
Access URL: https://zbmath.org/833525
https://doi.org/10.1002/cplx.6130010312
http://ui.adsabs.harvard.edu/abs/1995Cmplx...1c..40D/abstract
https://dblp.uni-trier.de/db/journals/complexity/complexity1.html#CostaD95
https://philpapers.org/rec/DACGIE
http://onlinelibrary.wiley.com/doi/10.1002/cplx.6130010312/abstract -
10
Authors: Tashiro, Hidetoshi
Subject Terms: Noncooperative games, Applications of computability and recursion theory, 2-person games
File Description: application/xml
Access URL: https://zbmath.org/1373376
-
11
Authors: Paweł Urzyczyn
Source: Fundamenta Informaticae. 19:201-222
Subject Terms: termination, Complexity of computation (including implicit computational complexity), Applications of computability and recursion theory, Theory of programming languages, existential quantification in types, Complexity classes (hierarchies, relations among complexity classes, etc.), computability over abstract strutures, halting problem over finite interpretations, 0102 computer and information sciences, primitive recursive definitions, 01 natural sciences
File Description: application/xml
-
12
Authors: Dimiter Skordev
Source: MLQ. 48:91-106
Subject Terms: Grzegorczyk classes, recursive real numbers, Applications of computability and recursion theory, primitive recursive real numbers, computable real numbers, Constructive and recursive analysis
File Description: application/xml
Access URL: https://zbmath.org/1850718
https://doi.org/10.1002/1521-3870(200210)48:1+<91::aid-malq91>3.0.co;2-l
https://onlinelibrary.wiley.com/doi/10.1002/1521-3870(200210)48:1+%3C91::AID-MALQ91%3E3.0.CO;2-L
https://dialnet.unirioja.es/servlet/articulo?codigo=2805295
https://dblp.uni-trier.de/db/journals/mlq/mlq48.html#Skordev02 -
13
Authors: Atsushi Yoshikawa
Source: Theoretical Computer Science. 284:487-498
Subject Terms: Calderón's method, Applications of computability and recursion theory, Interpolated computability structure, Complex interpolation functor, 0102 computer and information sciences, 0101 mathematics, Effective separability, 01 natural sciences, Constructive and recursive analysis, Theoretical Computer Science, Computer Science(all)
File Description: application/xml
-
14
Authors: Andreas Schlüter
Source: Archive for Mathematical Logic. 34:47-63
Subject Terms: universal algorithm, enumerating function, abstract Recursion Theorem, Applications of computability and recursion theory, modification of combinatory logic, constructive logic, Combinatory logic and lambda calculus, Metamathematics of constructive systems, 0101 mathematics, Other constructive mathematics, 01 natural sciences, computable function, explicit mathematics
File Description: application/xml
-
15
Authors:
Source: MLQ. 47:93-110
Subject Terms: KdV equations (Korteweg-de Vries equations), Applications of computability and recursion theory, computability of the solutions of the Korteweg-de Vries equation, periodic solution, Sobolev space, initial value problem, Constructive and recursive analysis
File Description: application/xml
Access URL: https://zbmath.org/1582659
https://doi.org/10.1002/1521-3870(200101)47:1<93::aid-malq93>3.0.co;2-c
https://dialnet.unirioja.es/servlet/articulo?codigo=2805350
https://dblp.uni-trier.de/db/journals/mlq/mlq47.html#GayZZ01
https://documat.unirioja.es/servlet/articulo?codigo=2805350
https://philpapers.org/rec/GAYCOS -
16
Authors: et al.
Contributors: et al.
Source: Synthese. 118:363-382
Subject Terms: learnability, Applications of computability and recursion theory, Computational learning theory, learning in coordinate choices, Rationality and learning in game theory, formal learning theory, identifiability
File Description: application/xml; STAMPA
-
17
Authors: Bakhadyr Khoussainov
Source: Annals of Pure and Applied Logic. 91:1-15
Subject Terms: Applications of computability and recursion theory, Logic, Equational classes, universal algebra in model theory, Kolmogorov complexity, randomness, 0102 computer and information sciences, finitely generated algebras, 0101 mathematics, 01 natural sciences, Theory of numerations, effectively presented structures, Algorithmic information theory (Kolmogorov complexity, etc.), Abstract data types, algebraic specification, abstract data types
File Description: application/xml
Access URL: https://www.sciencedirect.com/science/article/pii/S0168007297000407
https://www.sciencedirect.com/science/article/abs/pii/S0168007297000407
https://dblp.uni-trier.de/db/journals/apal/apal91.html#Khoussainov98
https://www.sciencedirect.com/science/article/pii/S0168007297000407#!
https://researchspace.auckland.ac.nz/handle/2292/3526 -
18
Authors:
Source: Mathematical Logic Quarterly. 45:23-30
Subject Terms: computability, self-similar set, Fractals, fractal, contractions in a metric space, Applications of computability and recursion theory, Computer graphics, computational geometry (digital and algorithmic aspects), 0102 computer and information sciences, 0101 mathematics, computable contractions, 01 natural sciences, Constructive and recursive analysis
File Description: application/xml
-
19
Authors: Roberto M. Amadio
Source: Information and Computation. 91:55-85
Subject Terms: realizability structures, Semantics in the theory of computing, Metamathematics of constructive systems, modelling of recursive definitions of programs and types, 0102 computer and information sciences, Cartesian closed category, 01 natural sciences, Theoretical Computer Science, Computer Science Applications, recursion on types, fixed-point operator, Computational Theory and Mathematics, Applications of computability and recursion theory, Scott domain, realizability model, Girard's system \(F\), higher-order lambda-calculus, Closed categories (closed monoidal and Cartesian closed categories, etc.), Combinatory logic and lambda calculus, higher-order domain equations, inductive types, 0101 mathematics, contractive operators, complete partial orders, Information Systems
File Description: application/xml
Access URL: https://zbmath.org/7876
https://doi.org/10.1016/0890-5401(91)90074-c
https://www.sciencedirect.com/science/article/pii/089054019190074C
https://dblp.uni-trier.de/db/journals/iandc/iandc91.html#Amadio91
https://www.sciencedirect.com/science/article/abs/pii/089054019190074C
https://www.sciencedirect.com/science/article/pii/089054019190074C#! -
20
Authors: Ker-I Ko
Source: Annals of Pure and Applied Logic. 93:195-216
Subject Terms: recursive real numbers, Complexity of computation (including implicit computational complexity), Logic, Julia sets, Hausdorff dimension, polynomial-time computable real functions, 0102 computer and information sciences, 01 natural sciences, Recursively approximable sets, Hausdorff measure, computable functions, Polynomial-time computable real functions, recursively approximable sets, Fractals, Applications of computability and recursion theory, computable curve, Recursive real numbers, Complexity classes (hierarchies, relations among complexity classes, etc.), 0101 mathematics, Constructive and recursive analysis
File Description: application/xml
Nájsť tento článok vo Web of Science 
Full Text Finder