:facetid:stream:\"streams/journals/computability\"OK:facetid:stream:streams/journals/computabilityPavel AlaevInversion operations in algebraic structures.Comput.124315-3222023Journal Articlesclosedjournals/computability/Alaev2310.3233/COM-230459https://doi.org/10.3233/COM-230459https://dblp.org/rec/journals/computability/Alaev23URL#102405Eric AllenderNikhil BalajiSamir DattaRameshwar PratapOn the complexity of algebraic numbers, and the bit-complexity of straight-line programs.Comput.122145-1732023Journal Articlesclosedjournals/computability/AllenderBDP2310.3233/COM-220407https://doi.org/10.3233/COM-220407https://dblp.org/rec/journals/computability/AllenderBDP23URL#102406Djamel Eddine AmirMathieu HoyrupStrong computable type.Comput.123227-2692023Journal Articlesclosedjournals/computability/AmirH2310.3233/COM-220430https://doi.org/10.3233/COM-220430https://dblp.org/rec/journals/computability/AmirH23URL#102407Uri AndrewsMingzhong CaiDavid DiamondstoneNoah SchweberLimit computability and ultrafilters.Comput.122101-1152023Journal Articlesclosedjournals/computability/AndrewsCDS2310.3233/COM-170176https://doi.org/10.3233/COM-170176https://dblp.org/rec/journals/computability/AndrewsCDS23URL#102408Nikolay BazhenovTakayuki KiharaSvetlana SelivanovaPreface.Comput.1242992023Journal Articlesclosedjournals/computability/BazhenovKS2310.3233/COM-230952https://doi.org/10.3233/COM-230952https://dblp.org/rec/journals/computability/BazhenovKS23URL#102409Nikolay BazhenovTakayuki KiharaSvetlana SelivanovaDieter SpreenOn the main scientific achievements of Victor Selivanov.Comput.124301-3142023Journal Articlesclosedjournals/computability/BazhenovKSS2310.3233/COM-230951https://doi.org/10.3233/COM-230951https://dblp.org/rec/journals/computability/BazhenovKSS23URL#102410Douglas CenzerChristopher P. PorterRandomness extraction in computability theory.Comput.1211-212023Journal Articlesclosedjournals/computability/CenzerP2310.3233/COM-210343https://doi.org/10.3233/COM-210343https://dblp.org/rec/journals/computability/CenzerP23URL#102411Marina DorzhievaAlexander G. MelnikovPunctually presented structures I: Closure theorems.Comput.124323-3372023Journal Articlesclosedjournals/computability/DorzhievaM2310.3233/COM-230448https://doi.org/10.3233/COM-230448https://dblp.org/rec/journals/computability/DorzhievaM23URL#102412Marat Kh. FaizrahmanovNumberings, c.e. oracles, and fixed points.Comput.123271-2822023Journal Articlesclosedjournals/computability/Faizrahmanov2310.3233/COM-210387https://doi.org/10.3233/COM-210387https://dblp.org/rec/journals/computability/Faizrahmanov23URL#102413Marat Kh. FaizrahmanovZlata ShchedrikovaEffectively infinite classes of numberings and computable families of reals.Comput.124339-3502023Journal Articlesclosedjournals/computability/FaizrahmanovS2310.3233/COM-230461https://doi.org/10.3233/COM-230461https://dblp.org/rec/journals/computability/FaizrahmanovS23URL#102414Riccardo GozziDaniel Graça 0001Characterizing time computational complexity classes with polynomial differential equations.Comput.12123-572023Journal Articlesclosedjournals/computability/GozziG2310.3233/COM-210384https://doi.org/10.3233/COM-210384https://dblp.org/rec/journals/computability/GozziG23URL#102415Daniel Silva GraçaNing Zhong 0002Analytic one-dimensional maps and two-dimensional ordinary differential equations can robustly simulate Turing machines.Comput.122117-1442023Journal Articlesclosedjournals/computability/GracaZ2310.3233/COM-210381https://doi.org/10.3233/COM-210381https://dblp.org/rec/journals/computability/GracaZ23URL#102416Jeffry L. HirstCarl MummertBanach's theorem in higher-order reverse mathematics.Comput.123203-2252023Journal Articlesclosedjournals/computability/HirstM2310.3233/COM-230453https://doi.org/10.3233/COM-230453https://dblp.org/rec/journals/computability/HirstM23URL#102417Mathieu HoyrupNotes on overt choice.Comput.124351-3692023Journal Articlesclosedjournals/computability/Hoyrup2310.3233/COM-230458https://doi.org/10.3233/COM-230458https://dblp.org/rec/journals/computability/Hoyrup23URL#102418Ruslan IshkuvatovDaniil MusatovAlexander ShenApproximating Kolmogorov complexity.Comput.123283-2972023Journal Articlesclosedjournals/computability/IshkuvatovMS2310.3233/COM-200302https://doi.org/10.3233/COM-200302https://dblp.org/rec/journals/computability/IshkuvatovMS23URL#102419Clara LöhMatthias UscholdL2-Betti numbers and computability of reals.Comput.122175-2012023Journal Articlesclosedjournals/computability/LohU2310.3233/COM-220416https://doi.org/10.3233/COM-220416https://dblp.org/rec/journals/computability/LohU23URL#102420Victor L. SelivanovSvetlana SelivanovaPrimitive recursive ordered fields and some applications.Comput.12171-992023Journal Articlesclosedjournals/computability/SelivanovS2310.3233/COM-210386https://doi.org/10.3233/COM-210386https://dblp.org/rec/journals/computability/SelivanovS23URL#102421Dieter SpreenHow much partiality is needed for a theory of computability?Comput.124371-4262023Journal Articlesclosedjournals/computability/Spreen2310.3233/COM-230463https://doi.org/10.3233/COM-230463https://dblp.org/rec/journals/computability/Spreen23URL#102422James Walsh 0007Evitable iterates of the consistency operator.Comput.12159-692023Journal Articlesclosedjournals/computability/Walsh2310.3233/COM-220400https://doi.org/10.3233/COM-220400https://dblp.org/rec/journals/computability/Walsh23URL#102423Bruno BauwensPéter GácsAndrei E. RomashchenkoAlexander ShenInequalities for space-bounded Kolmogorov complexity.Comput.113-4165-1852022Journal Articlesclosedjournals/computability/BauwensGRS2210.3233/COM-210374https://doi.org/10.3233/COM-210374https://dblp.org/rec/journals/computability/BauwensGRS22URL#589079Nikolay BazhenovKeng Meng NgLuca San MauroAndrea SorbiPrimitive recursive equivalence relations and their primitive recursive complexity.Comput.113-4187-2212022Journal Articlesclosedjournals/computability/BazhenovNMS2210.3233/COM-210375https://doi.org/10.3233/COM-210375https://dblp.org/rec/journals/computability/BazhenovNMS22URL#589080Vasco BrattkaNoam GreenbergIskander Sh. KalimullinMariya Ivanova SoskovaPreface of the Special Issue for the Oberwolfach Workshop on Computability Theory 2021.Comput.113-41632022Journal Articlesclosedjournals/computability/BrattkaGKS2210.3233/COM-220950https://doi.org/10.3233/COM-220950https://dblp.org/rec/journals/computability/BrattkaGKS22URL#589081Wesley CalvertDouglas CenzerValentina S. HarizanovGenerically and coarsely computable isomorphisms.Comput.113-4223-2392022Journal Articlesclosedjournals/computability/CalvertCH2210.3233/COM-210382https://doi.org/10.3233/COM-210382https://dblp.org/rec/journals/computability/CalvertCH22URL#589082Merlin CarlSpace-bounded OTMs and REG∞.Comput.11141-562022Journal Articlesclosedjournals/computability/Carl2210.3233/COM-200327https://doi.org/10.3233/COM-200327https://dblp.org/rec/journals/computability/Carl22URL#589083Peter CholakPeter M. GerdesExtending properly n-REA sets.Comput.113-4241-2672022Journal Articlesclosedjournals/computability/CholakG2210.3233/COM-210362https://doi.org/10.3233/COM-210362https://dblp.org/rec/journals/computability/CholakG22URL#589084Jun Le GohSteffen LemppKeng Meng NgMariya Ivanova SoskovaExtensions of two constructions of Ahmad.Comput.113-4269-2972022Journal Articlesclosedjournals/computability/GohLNS2210.3233/COM-210380https://doi.org/10.3233/COM-210380https://dblp.org/rec/journals/computability/GohLNS22URL#589085Anton GolovSebastiaan A. TerwijnFixpoints and relative precompleteness.Comput.112135-1462022Journal Articlesclosedjournals/computability/GolovT2210.3233/COM-210344https://doi.org/10.3233/COM-210344https://dblp.org/rec/journals/computability/GolovT22URL#589086Neil LutzDonald M. StullDimension spectra of lines.Comput.11285-1122022Journal Articlesclosedjournals/computability/LutzS2210.3233/COM-190292https://doi.org/10.3233/COM-190292https://dblp.org/rec/journals/computability/LutzS22URL#589087Alberto MarconeManlio ValentiEffective aspects of Hausdorff and Fourier dimension.Comput.113-4299-3332022Journal Articlesclosedjournals/computability/MarconeV2210.3233/COM-210372https://doi.org/10.3233/COM-210372https://dblp.org/rec/journals/computability/MarconeV22URL#589088Pace P. NielsenDefinitional schemes for primitive recursive and computable functions.Comput.1111-82022Journal Articlesclosedjournals/computability/Nielsen2210.3233/COM-210312https://doi.org/10.3233/COM-210312https://dblp.org/rec/journals/computability/Nielsen22URL#589089Sam SandersCountable sets versus sets that are countable in reverse mathematics.Comput.1119-392022Journal Articlesclosedjournals/computability/Sanders2210.3233/COM-210313https://doi.org/10.3233/COM-210313https://dblp.org/rec/journals/computability/Sanders22URL#589090Peter Schuster 0001Daniel Misselbeck-WesselThe Jacobson radical for an inconsistency predicate.Comput.112147-1622022Journal Articlesclosedjournals/computability/SchusterW2210.3233/COM-210365https://doi.org/10.3233/COM-210365https://dblp.org/rec/journals/computability/SchusterW22URL#589091Victor L. SelivanovNon-collapse of the effective Wadge hierarchy.Comput.113-4335-3582022Journal Articlesclosedjournals/computability/Selivanov2210.3233/COM-210376https://doi.org/10.3233/COM-210376https://dblp.org/rec/journals/computability/Selivanov22URL#589092Martin VuHenning FernauInsertion-deletion systems with substitutions I.Comput.11157-832022Journal Articlesclosedjournals/computability/VuF2210.3233/COM-210345https://doi.org/10.3233/COM-210345https://dblp.org/rec/journals/computability/VuF22URL#589093Klaus WeihrauchIntersection points of planar curves can be computed.Comput.112113-1332022Journal Articlesclosedjournals/computability/Weihrauch2210.3233/COM-210311https://doi.org/10.3233/COM-210311https://dblp.org/rec/journals/computability/Weihrauch22URL#589094Katherine ArthurRod DowneyNoam GreenbergMaximality and collapse in the hierarchy of α-c.a. degrees.Comput.103181-2142021Journal Articlesclosedjournals/computability/ArthurDG2110.3233/COM-200297https://doi.org/10.3233/COM-200297https://dblp.org/rec/journals/computability/ArthurDG21URL#1067893James BarnesThe Σ2 theory of Dh(⩽hO) as an uppersemilattice with least and greatest element is decidable.Comput.104305-3252021Journal Articlesclosedjournals/computability/Barnes2110.3233/COM-210308https://doi.org/10.3233/COM-210308https://dblp.org/rec/journals/computability/Barnes21URL#1067894Nikolay BazhenovEkaterina B. FokinaDino RosseggerLuca San MauroDegrees of bi-embeddable categoricity.Comput.1011-162021Journal Articlesclosedjournals/computability/BazhenovFRM2110.3233/COM-190289https://doi.org/10.3233/COM-190289https://dblp.org/rec/journals/computability/BazhenovFRM21URL#1067895Zach BeMentJeffry L. HirstAsuka WallaceReverse mathematics and Weihrauch analysis motivated by finite complexity theory.Comput.104343-3542021Journal Articlesclosedjournals/computability/BeMentHW2110.3233/COM-210310https://doi.org/10.3233/COM-210310https://dblp.org/rec/journals/computability/BeMentHW21URL#1067896Tyler A. BrownComputing on the Banach space C[0, 1].Comput.103257-2702021Journal Articlesclosedjournals/computability/Brown2110.3233/COM-200306https://doi.org/10.3233/COM-200306https://dblp.org/rec/journals/computability/Brown21URL#1067897Merlin CarlEffectivity and reducibility with ordinal Turing machines.Comput.104289-3042021Journal Articlesclosedjournals/computability/Carl2110.3233/COM-210307https://doi.org/10.3233/COM-210307https://dblp.org/rec/journals/computability/Carl21URL#1067898Patrizio CintioliDegrees of sets having no subsets of higher m- and tt-degree.Comput.103235-2552021Journal Articlesclosedjournals/computability/Cintioli2110.3233/COM-200296https://doi.org/10.3233/COM-200296https://dblp.org/rec/journals/computability/Cintioli21URL#1067899Edgar G. DaylightThe halting problem and security's language-theoretic approach: Praise and criticism from a technical historian.Comput.102141-1582021Journal Articlesclosedjournals/computability/Daylight2110.3233/COM-180217https://doi.org/10.3233/COM-180217https://dblp.org/rec/journals/computability/Daylight21URL#1067900Damir D. DzhafarovLudovic PateyCOH, SRT22, and multiple functionals.Comput.102111-1212021Journal Articlesclosedjournals/computability/DzhafarovP2110.3233/COM-190261https://doi.org/10.3233/COM-190261https://dblp.org/rec/journals/computability/DzhafarovP21URL#1067901Marta Fiori-CaronesAlberto MarconeTo reorient is easier than to orient: An on-line algorithm for reorientation of graphs.Comput.103215-2332021Journal Articlesclosedjournals/computability/Fiori-CaronesM2110.3233/COM-190285https://doi.org/10.3233/COM-190285https://dblp.org/rec/journals/computability/Fiori-CaronesM21URL#1067902Makoto FujiwaraWeihrauch and constructive reducibility between existence statements.Comput.10117-302021Journal Articlesclosedjournals/computability/Fujiwara2110.3233/COM-190278https://doi.org/10.3233/COM-190278https://dblp.org/rec/journals/computability/Fujiwara21URL#1067903Liling KoNonlowness is independent from fickleness.Comput.104271-2882021Journal Articlesclosedjournals/computability/Ko2110.3233/COM-190269https://doi.org/10.3233/COM-190269https://dblp.org/rec/journals/computability/Ko21URL#1067904Michal KonecnýEike NeumannRepresentations and evaluation strategies for feasibly approximable functions.Comput.10163-892021Journal Articlesclosedjournals/computability/KonecnyN2110.3233/COM-180234https://doi.org/10.3233/COM-180234https://dblp.org/rec/journals/computability/KonecnyN21URL#1067905Justin MillerIntermediate intrinsic density and randomness.Comput.104327-3412021Journal Articlesclosedjournals/computability/Miller2110.3233/COM-210309https://doi.org/10.3233/COM-210309https://dblp.org/rec/journals/computability/Miller21URL#1067906Dag NormannMeasure-theoretic uniformity and the Suslin functional.Comput.10291-1052021Journal Articlesclosedjournals/computability/Normann2110.3233/COM-190248https://doi.org/10.3233/COM-190248https://dblp.org/rec/journals/computability/Normann21URL#1067907Sam SandersNets and reverse mathematics.Comput.10131-622021Journal Articlesclosedjournals/computability/Sanders2110.3233/COM-190265https://doi.org/10.3233/COM-190265https://dblp.org/rec/journals/computability/Sanders21URL#1067908Svetlana SelivanovaVictor L. SelivanovBit complexity of computing solutions for symmetric hyperbolic systems of PDEs with guaranteed precision.Comput.102123-1402021Journal Articlesclosedjournals/computability/SelivanovaS2110.3233/COM-180215https://doi.org/10.3233/COM-180215https://dblp.org/rec/journals/computability/SelivanovaS21URL#1067909Philip D. WelchCharacterisations of variant transfinite computational models: Infinite time Turing, ordinal time Turing, and Blum-Shub-Smale machines.Comput.102159-1802021Journal Articlesclosedjournals/computability/Welch2110.3233/COM-200301https://doi.org/10.3233/COM-200301https://dblp.org/rec/journals/computability/Welch21URL#1067910Linda WestrickA note on the diamond operator.Comput.102107-1102021Journal Articlesclosedjournals/computability/Westrick2110.3233/COM-200295https://doi.org/10.3233/COM-200295https://dblp.org/rec/journals/computability/Westrick21URL#1067911Vasco BrattkaDamir D. DzhafarovAlberto MarconeArno PaulyDagstuhl Seminar on Measuring the Complexity of Computational Content 2018.Comput.93-4167-1682020Journal Articlesclosedjournals/computability/BrattkaDMP2010.3233/COM-208001https://doi.org/10.3233/COM-208001https://dblp.org/rec/journals/computability/BrattkaDMP20URL#1530373Matthew de BrechtArno PaulyMatthias Schröder 0001Overt choice.Comput.93-4169-1912020Journal Articlesclosedjournals/computability/BrechtPS2010.3233/COM-190253https://doi.org/10.3233/COM-190253https://dblp.org/rec/journals/computability/BrechtPS20URL#1530374Cristian S. CaludeMonica DumitrescuA statistical anytime algorithm for the Halting Problem.Comput.92155-1662020Journal Articlesclosedjournals/computability/CaludeD2010.3233/COM-190250https://doi.org/10.3233/COM-190250https://dblp.org/rec/journals/computability/CaludeD20URL#1530375Lorenzo CarlucciLeszek Aleksander KolodziejczykFrancesco LeporeKonrad ZdanowskiNew bounds on the strength of some restrictions of Hindman's Theorem.Comput.92139-1532020Journal Articlesclosedjournals/computability/CarlucciKLZ2010.3233/COM-190264https://doi.org/10.3233/COM-190264https://dblp.org/rec/journals/computability/CarlucciKLZ20URL#1530376Peter A. CholakDamir D. DzhafarovDenis R. HirschfeldtLudovic PateySome results concerning the SRT22 vs. COH problem.Comput.93-4193-2172020Journal Articlesclosedjournals/computability/CholakDHP2010.3233/COM-190251https://doi.org/10.3233/COM-190251https://dblp.org/rec/journals/computability/CholakDHP20URL#1530377Barbara F. CsimaMichael DeveauMatthew Harrison-TrainorMohammad Assem MahmoudDegrees of categoricity above limit ordinals.Comput.92127-1372020Journal Articlesclosedjournals/computability/CsimaDHM2010.3233/COM-190254https://doi.org/10.3233/COM-190254https://dblp.org/rec/journals/computability/CsimaDHM20URL#1530378Caleb DavisDenis R. HirschfeldtJeffry L. HirstJake PardoArno PaulyKeita YokoyamaCombinatorial principles equivalent to weak induction.Comput.93-4219-2292020Journal Articlesclosedjournals/computability/DavisHHPPY2010.3233/COM-180244https://doi.org/10.3233/COM-180244https://dblp.org/rec/journals/computability/DavisHHPPY20URL#1530379Damir D. DzhafarovJun Le GohDenis R. HirschfeldtLudovic PateyArno PaulyRamsey's theorem and products in the Weihrauch degrees.Comput.9285-1102020Journal Articlesclosedjournals/computability/DzhafarovGHPP2010.3233/COM-180203https://doi.org/10.3233/COM-180203https://dblp.org/rec/journals/computability/DzhafarovGHPP20URL#1530380Henning FernauTill FluschnikDanny HermelinAndreas KrebsHendrik MolterRolf NiedermeierDiminishable parameterized problems and strict polynomial kernelization.Comput.911-242020Journal Articlesclosedjournals/computability/FernauFHKMN2010.3233/COM-180220https://doi.org/10.3233/COM-180220https://dblp.org/rec/journals/computability/FernauFHKMN20URL#1530381Peter M. GerdesAn ω-REA set forming a minimal pair with 0~′.Comput.9137-502020Journal Articlesclosedjournals/computability/Gerdes2010.3233/COM-180191https://doi.org/10.3233/COM-180191https://dblp.org/rec/journals/computability/Gerdes20URL#1530382Jun Le GohCompositions of multivalued functions.Comput.93-4231-2472020Journal Articlesclosedjournals/computability/Goh2010.3233/COM-180235https://doi.org/10.3233/COM-180235https://dblp.org/rec/journals/computability/Goh20URL#1530383Peter HertlingForests describing Wadge degrees and topological Weihrauch degrees of certain classes of functions and relations.Comput.93-4249-3072020Journal Articlesclosedjournals/computability/Hertling2010.3233/COM-190255https://doi.org/10.3233/COM-190255https://dblp.org/rec/journals/computability/Hertling20URL#1530384Jeffry L. HirstLeaf management.Comput.93-4309-3142020Journal Articlesclosedjournals/computability/Hirst2010.3233/COM-180243https://doi.org/10.3233/COM-180243https://dblp.org/rec/journals/computability/Hirst20URL#1530385Reese JohnstonCantor-Bendixson ranks of effectively closed sets in admissible recursion theory.Comput.92111-1252020Journal Articlesclosedjournals/computability/Johnston2010.3233/COM-180187https://doi.org/10.3233/COM-180187https://dblp.org/rec/journals/computability/Johnston20URL#1530386Pietro MiliciA differential extension of Descartes' foundational approach: A new balance between symbolic and analog computation.Comput.9151-832020Journal Articlesclosedjournals/computability/Milici2010.3233/COM-180208https://doi.org/10.3233/COM-180208https://dblp.org/rec/journals/computability/Milici20URL#1530387Takako NemotoA constructive proof of the dense existence of nowhere-differentiable functions in C[0, 1].Comput.93-4315-3262020Journal Articlesclosedjournals/computability/Nemoto2010.3233/COM-190247https://doi.org/10.3233/COM-190247https://dblp.org/rec/journals/computability/Nemoto20URL#1530388Victor L. SelivanovQ-Wadge degrees as free structures.Comput.93-4327-3412020Journal Articlesclosedjournals/computability/Selivanov2010.3233/COM-180241https://doi.org/10.3233/COM-180241https://dblp.org/rec/journals/computability/Selivanov20URL#1530389Paul ShaferThe strength of compactness for countable complete linear orders.Comput.9125-362020Journal Articlesclosedjournals/computability/Shafer2010.3233/COM-190262https://doi.org/10.3233/COM-190262https://dblp.org/rec/journals/computability/Shafer20URL#1530390Uri AndrewsAndrea SorbiJoins and meets in the structure of ceers.Comput.83-4193-2412019Journal Articlesclosedjournals/computability/AndrewsS1910.3233/COM-180098https://doi.org/10.3233/COM-180098https://dblp.org/rec/journals/computability/AndrewsS19URL#1962269Mark ArmstrongJeffery I. ZuckerNotions of semicomputability in topological algebras over the reals.Comput.811-262019Journal Articlesclosedjournals/computability/ArmstrongZ1910.3233/COM-180087https://doi.org/10.3233/COM-180087https://dblp.org/rec/journals/computability/ArmstrongZ19URL#1962270Eric P. AstorDenis R. HirschfeldtDense computability, upper cones, and minimal pairs.Comput.82155-1772019Journal Articlesclosedjournals/computability/AstorH1910.3233/COM-180231https://doi.org/10.3233/COM-180231https://dblp.org/rec/journals/computability/AstorH19URL#1962271Arnold BeckmannSam BussSy-David FriedmanMoritz MüllerNeil ThapenFeasible set functions have small circuits.Comput.8167-982019Journal Articlesclosedjournals/computability/BeckmannBFMT1910.3233/COM-180096https://doi.org/10.3233/COM-180096https://dblp.org/rec/journals/computability/BeckmannBFMT19URL#1962272Vasco BrattkaRod DowneyJulia F. KnightSteffen LemppPreface of the special issue for the Oberwolfach Workshop on Computability Theory 2018.Comput.83-41912019Journal Articlesclosedjournals/computability/BrattkaDKL1910.3233/COM-180103https://doi.org/10.3233/COM-180103https://dblp.org/rec/journals/computability/BrattkaDKL19URL#1962273Ellen ChihRod DowneySplitting theorems and low degrees.Comput.83-4243-2522019Journal Articlesclosedjournals/computability/ChihD1910.3233/COM-180093https://doi.org/10.3233/COM-180093https://dblp.org/rec/journals/computability/ChihD19URL#1962274Barbara F. CsimaDamir D. DzhafarovDenis R. HirschfeldtCarl G. Jockusch Jr.Reed SolomonLinda Brown WestrickThe reverse mathematics of Hindman's Theorem for sums of exactly two elements.Comput.83-4253-2632019Journal Articlesclosedjournals/computability/CsimaDHJSW1910.3233/COM-180094https://doi.org/10.3233/COM-180094https://dblp.org/rec/journals/computability/CsimaDHJSW19URL#1962275Ekaterina B. FokinaDino RosseggerLuca San MauroMeasuring the complexity of reductions between equivalence relations.Comput.83-4265-2802019Journal Articlesclosedjournals/computability/FokinaRM1910.3233/COM-180100https://doi.org/10.3233/COM-180100https://dblp.org/rec/journals/computability/FokinaRM19URL#1962276Guido GherardiAlberto MarconeArno PaulyProjection operators in the Weihrauch lattice.Comput.83-4281-3042019Journal Articlesclosedjournals/computability/GherardiMP1910.3233/COM-180207https://doi.org/10.3233/COM-180207https://dblp.org/rec/journals/computability/GherardiMP19URL#1962277Petr A. GolovachMatthew Johnson 0002Barnaby MartinDaniël PaulusmaAnthony StewartSurjective H-colouring: New hardness results.Comput.8127-422019Journal Articlesclosedjournals/computability/GolovachJMPS1910.3233/COM-180084https://doi.org/10.3233/COM-180084https://dblp.org/rec/journals/computability/GolovachJMPS19URL#1962278Noam GreenbergRutger KuyperDan TuretskyCardinal invariants, non-lowness classes, and Weihrauch reducibility.Comput.83-4305-3462019Journal Articlesclosedjournals/computability/GreenbergKT1910.3233/COM-180219https://doi.org/10.3233/COM-180219https://dblp.org/rec/journals/computability/GreenbergKT19URL#1962279Matthew Harrison-TrainorA first-order theory of Ulm type.Comput.83-4347-3582019Journal Articlesclosedjournals/computability/Harrison-Trainor1910.3233/COM-180099https://doi.org/10.3233/COM-180099https://dblp.org/rec/journals/computability/Harrison-Trainor19URL#1962280Matthew Harrison-TrainorBakh KhoussainovDaniel TuretskyEffective aspects of algorithmically random structures.Comput.83-4359-3752019Journal Articlesclosedjournals/computability/Harrison-Trainor19a10.3233/COM-180101https://doi.org/10.3233/COM-180101https://dblp.org/rec/journals/computability/Harrison-Trainor19aURL#1962281Ulrich KohlenbachOn the reverse mathematics and Weihrauch complexity of moduli of regularity and uniqueness.Comput.83-4377-3872019Journal Articlesclosedjournals/computability/Kohlenbach1910.3233/COM-180097https://doi.org/10.3233/COM-180097https://dblp.org/rec/journals/computability/Kohlenbach19URL#1962282Lars KristiansenOn subrecursive representability of irrational numbers, part II.Comput.8143-652019Journal Articlesclosedjournals/computability/Kristiansen1910.3233/COM-170081https://doi.org/10.3233/COM-170081https://dblp.org/rec/journals/computability/Kristiansen19URL#1962283John LongleyBar recursion is not computable via iteration.Comput.82119-1532019Journal Articlesclosedjournals/computability/Longley1910.3233/COM-180200https://doi.org/10.3233/COM-180200https://dblp.org/rec/journals/computability/Longley19URL#1962284Timothy H. McNichollDonald M. StullThe isometry degree of a computable copy of ℓ p.Comput.82179-1892019Journal Articlesclosedjournals/computability/McNichollS1910.3233/COM-180214https://doi.org/10.3233/COM-180214https://dblp.org/rec/journals/computability/McNichollS19URL#1962285Russell Miller 0001Isomorphism and classification for countable structures.Comput.8299-1172019Journal Articlesclosedjournals/computability/Miller1910.3233/COM-180095https://doi.org/10.3233/COM-180095https://dblp.org/rec/journals/computability/Miller19URL#1962286Iván Ongay-ValverdeNoah David SchweberEffective localization number: Building k-surviving degrees.Comput.83-4389-3982019Journal Articlesclosedjournals/computability/Ongay-ValverdeS1910.3233/COM-180199https://doi.org/10.3233/COM-180199https://dblp.org/rec/journals/computability/Ongay-ValverdeS19URL#1962287Klaus WeihrauchComputable planar curves intersect in a computable point.Comput.83-4399-4152019Journal Articlesclosedjournals/computability/Weihrauch1910.3233/COM-180102https://doi.org/10.3233/COM-180102https://dblp.org/rec/journals/computability/Weihrauch19URL#1962288Klaus Ambos-SpiesAutomorphism bases for the recursively enumerable degrees.Comput.72-3237-2582018Journal Articlesclosedjournals/computability/Ambos-Spies1810.3233/COM-180088https://doi.org/10.3233/COM-180088https://dblp.org/rec/journals/computability/Ambos-Spies18URL#2370733Spencer BackmanTony HuynhTransfinite Ford-Fulkerson on a finite network.Comput.74341-3472018Journal Articlesclosedjournals/computability/BackmanH1810.3233/COM-180082https://doi.org/10.3233/COM-180082https://dblp.org/rec/journals/computability/BackmanH18URL#2370734George BarmpaliasAndrew Lewis-PyeAngsheng LiPointed computations and Martin-Löf randomness.Comput.72-3171-1772018Journal Articlesclosedjournals/computability/BarmpaliasLL1810.3233/COM-170076https://doi.org/10.3233/COM-170076https://dblp.org/rec/journals/computability/BarmpaliasLL18URL#2370735Cristian S. CaludeMonica DumitrescuA probabilistic anytime algorithm for the halting problem.Comput.72-3259-2712018Journal Articlesclosedjournals/computability/CaludeD1810.3233/COM-170073https://doi.org/10.3233/COM-170073https://dblp.org/rec/journals/computability/CaludeD18URL#2370736S. Barry CooperJames GayCharles M. HarrisKyung Il LeeAnthony MorphettLinearisations and the Ershov hierarchy.Comput.72-3143-1692018Journal Articlesclosedjournals/computability/CooperGHLM1810.3233/COM-170080https://doi.org/10.3233/COM-170080https://dblp.org/rec/journals/computability/CooperGHLM18URL#2370737Joe DavidsonGreg MichaelsonExpressiveness, meanings and machines.Comput.74367-3942018Journal Articlesclosedjournals/computability/DavidsonM1810.3233/COM-180090https://doi.org/10.3233/COM-180090https://dblp.org/rec/journals/computability/DavidsonM18URL#2370738Richard ElwesAndy Lewis-PyeBenedikt LöweDugald MacphersonDag NormannAndrea SorbiAlexandra A. SoskovaMariya Ivanova SoskovaPeter van Emde BoasStanley S. WainerS. Barry Cooper (1943-2015).Comput.72-3103-1312018Journal Articlesclosedjournals/computability/ElwesLLMNSSSBW1810.3233/COM-180092https://doi.org/10.3233/COM-180092https://dblp.org/rec/journals/computability/ElwesLLMNSSSBW18URL#2370739Johanna N. Y. FranklinDan TuretskyLowness for isomorphism and degrees of genericity.Comput.711-62018Journal Articlesclosedjournals/computability/FranklinT1810.3233/COM-170078https://doi.org/10.3233/COM-170078https://dblp.org/rec/journals/computability/FranklinT18URL#2370740Hristo Aleksndrov GanchevMariya Ivanova SoskovaThe jump hierarchy in the enumeration degrees.Comput.72-3179-1882018Journal Articlesclosedjournals/computability/GanchevS1810.3233/COM-170072https://doi.org/10.3233/COM-170072https://dblp.org/rec/journals/computability/GanchevS18URL#2370741Shuichi HiraharaAkitoshi KawamuraOn characterizations of randomized computation using plain Kolmogorov complexity.Comput.7145-562018Journal Articlesclosedjournals/computability/HiraharaK1810.3233/COM-170075https://doi.org/10.3233/COM-170075https://dblp.org/rec/journals/computability/HiraharaK18URL#2370742Zvonko IljazovicBojan PazekComputable intersection points.Comput.7157-992018Journal Articlesclosedjournals/computability/IljazovicP1810.3233/COM-170079https://doi.org/10.3233/COM-170079https://dblp.org/rec/journals/computability/IljazovicP18URL#2370743Sanjay Jain 0001Bakhadyr KhoussainovFrank Stephan 0001Finitely generated semiautomatic groups.Comput.72-3273-2872018Journal Articlesclosedjournals/computability/JainKS1810.3233/COM-180089https://doi.org/10.3233/COM-180089https://dblp.org/rec/journals/computability/JainKS18URL#2370744Andrew E. M. Lewis-PyeThe search for natural definability in the Turing degrees.Comput.72-3189-2352018Journal Articlesclosedjournals/computability/Lewis-Pye1810.3233/COM-170068https://doi.org/10.3233/COM-170068https://dblp.org/rec/journals/computability/Lewis-Pye18URL#2370745Angsheng LiMingji XiaSplitting and jump inversion in the Turing degrees.Comput.72-3133-1422018Journal Articlesclosedjournals/computability/LiX1810.3233/COM-180083https://doi.org/10.3233/COM-180083https://dblp.org/rec/journals/computability/LiX18URL#2370746Benedikt LöwePreface to the special issue in memory of S. Barry Cooper (1943-2015).Comput.72-31012018Journal Articlesclosedjournals/computability/Lowe1810.3233/COM-180091https://doi.org/10.3233/COM-180091https://dblp.org/rec/journals/computability/Lowe18URL#2370747Ludovic PateyPartial orders and immunity in reverse mathematics.Comput.74323-3392018Journal Articlesclosedjournals/computability/Patey1810.3233/COM-170071https://doi.org/10.3233/COM-170071https://dblp.org/rec/journals/computability/Patey18URL#2370748Diogo PoçasJeffery I. ZuckerAnalog networks on function data streams.Comput.74301-3222018Journal Articlesclosedjournals/computability/PocasZ1810.3233/COM-170077https://doi.org/10.3233/COM-170077https://dblp.org/rec/journals/computability/PocasZ18URL#2370749Sam SandersThe Gandy-Hyland functional and a computational aspect of Nonstandard Analysis.Comput.717-432018Journal Articlesclosedjournals/computability/Sanders1810.3233/COM-170074https://doi.org/10.3233/COM-170074https://dblp.org/rec/journals/computability/Sanders18URL#2370750Victor L. SelivanovMars M. YamaleevExtending Cooper's theorem to Δ 3 0 Turing degrees.Comput.72-3289-3002018Journal Articlesclosedjournals/computability/SelivanovY1810.3233/COM-180085https://doi.org/10.3233/COM-180085https://dblp.org/rec/journals/computability/SelivanovY18URL#2370751Matthew WrightDegrees of relations on ordinals.Comput.74349-3652018Journal Articlesclosedjournals/computability/Wright1810.3233/COM-180086https://doi.org/10.3233/COM-180086https://dblp.org/rec/journals/computability/Wright18URL#2370752Francis AdamsDouglas CenzerComputability and categoricity of weakly ultrahomogeneous structures.Comput.64365-3892017Journal Articlesclosedjournals/computability/AdamsC1710.3233/COM-170070https://doi.org/10.3233/COM-170070https://dblp.org/rec/journals/computability/AdamsC17URL#2739658Manindra AgrawalDiptarka ChakrabortyDebarati Das 0001Satyadev NandakumarDimension, pseudorandomness and extraction of pseudorandomness.Comput.63277-3052017Journal Articlesclosedjournals/computability/AgrawalCDN1710.3233/COM-160066https://doi.org/10.3233/COM-160066https://dblp.org/rec/journals/computability/AgrawalCDN17URL#2739659Merlin CarlInfinite time recognizability from generic oracles and the recognizable jump operator.Comput.63223-2472017Journal Articlesclosedjournals/computability/Carl1710.3233/COM-160061https://doi.org/10.3233/COM-160061https://dblp.org/rec/journals/computability/Carl17URL#2739660Peter CholakRachel EpsteinComputably enumerable sets that are automorphic to low sets.Comput.6123-452017Journal Articlesclosedjournals/computability/CholakE1710.3233/COM-160053https://doi.org/10.3233/COM-160053https://dblp.org/rec/journals/computability/CholakE17URL#2739661Damir D. DzhafarovGregory IgusaNotions of robust information coding.Comput.62105-1242017Journal Articlesclosedjournals/computability/DzhafarovI1710.3233/COM-160059https://doi.org/10.3233/COM-160059https://dblp.org/rec/journals/computability/DzhafarovI17URL#2739662Emanuele FrittaionLudovic PateyColoring the rationals in reverse mathematics.Comput.64319-3312017Journal Articlesclosedjournals/computability/FrittaionP1710.3233/COM-160067https://doi.org/10.3233/COM-160067https://dblp.org/rec/journals/computability/FrittaionP17URL#2739663Rica GonenAnat LernerCharacterizing incentive compatible, Pareto optimal and sufficiently anonymous constrained combinatorial mechanisms - Two players case.Comput.62183-2082017Journal Articlesclosedjournals/computability/GonenL1710.3233/COM-160064https://doi.org/10.3233/COM-160064https://dblp.org/rec/journals/computability/GonenL17URL#2739664Martin HuschenbettAlexander KartzowPhilipp SchlichtPumping for ordinal-automatic structures.Comput.62125-1642017Journal Articlesclosedjournals/computability/HuschenbettKS1710.3233/COM-160057https://doi.org/10.3233/COM-160057https://dblp.org/rec/journals/computability/HuschenbettKS17URL#2739665Oscar H. IbarraCewei CuiZhe DangThomas R. FischerLossiness of communication channels modeled by transducers.Comput.62165-1812017Journal Articlesclosedjournals/computability/IbarraCDF1710.3233/COM-150050https://doi.org/10.3233/COM-150050https://dblp.org/rec/journals/computability/IbarraCDF17URL#2739666Sanjay Jain 0001Frank Stephan 0001Jason TeutschClosed left-r.e. sets.Comput.611-212017Journal Articlesclosedjournals/computability/JainST1710.3233/COM-160054https://doi.org/10.3233/COM-160054https://dblp.org/rec/journals/computability/JainST17URL#2739667Lars KristiansenOn subrecursive representability of irrational numbers.Comput.63249-2762017Journal Articlesclosedjournals/computability/Kristiansen1710.3233/COM-160063https://doi.org/10.3233/COM-160063https://dblp.org/rec/journals/computability/Kristiansen17URL#2739668Timothy H. McNichollComputable copies of ℓp.Comput.64391-4082017Journal Articlesclosedjournals/computability/McNicholl1710.3233/COM-160065https://doi.org/10.3233/COM-160065https://dblp.org/rec/journals/computability/McNicholl17URL#2739669Alexei MiasnikovPaul E. SchuppComputational complexity and the conjugacy problem.Comput.64307-3182017Journal Articlesclosedjournals/computability/MiasnikovS1710.3233/COM-160060https://doi.org/10.3233/COM-160060https://dblp.org/rec/journals/computability/MiasnikovS17URL#2739670Arthur MilchiorUndecidability of satisfiability of expansions of FO[<] over words with a FO[+]-definable set.Comput.64333-3632017Journal Articlesclosedjournals/computability/Milchior1710.3233/COM-170069https://doi.org/10.3233/COM-170069https://dblp.org/rec/journals/computability/Milchior17URL#2739671Ludovic PateyControlling iterated jumps of solutions to combinatorial problems.Comput.6147-782017Journal Articlesclosedjournals/computability/Patey1710.3233/COM-160056https://doi.org/10.3233/COM-160056https://dblp.org/rec/journals/computability/Patey17URL#2739672Ludovic PateyIterative forcing and hyperimmunity in reverse mathematics.Comput.63209-2212017Journal Articlesclosedjournals/computability/Patey17a10.3233/COM-160062https://doi.org/10.3233/COM-160062https://dblp.org/rec/journals/computability/Patey17aURL#2739673Klaus WeihrauchComputability on measurable functions.Comput.6179-1042017Journal Articlesclosedjournals/computability/Weihrauch1710.3233/COM-160058https://doi.org/10.3233/COM-160058https://dblp.org/rec/journals/computability/Weihrauch17URL#2739674Sankha S. BasuStephen G. SimpsonMass problems and intuitionistic higher-order logic.Comput.5129-472016Journal Articlesclosedjournals/computability/BasuS1610.3233/COM-150041https://doi.org/10.3233/COM-150041https://dblp.org/rec/journals/computability/BasuS16URL#3078355Vasco BrattkaPaola BonizzoniOlivier BournezElvira MayordomoEditorial.Comput.5112016Journal Articlesclosedjournals/computability/BrattkaBBM1610.3233/COM-160051https://doi.org/10.3233/COM-160051https://dblp.org/rec/journals/computability/BrattkaBBM16URL#3078356Mingzhong CaiSteffen LemppJoseph S. MillerMariya Ivanova SoskovaOn Kalimullin pairs.Comput.52111-1262016Journal Articlesclosedjournals/computability/CaiLMS1510.3233/COM-150046https://doi.org/10.3233/COM-150046https://dblp.org/rec/journals/computability/CaiLMS15URL#3078357Merlin CarlRandomness and degree theory for infinite time register machines.Comput.52181-1962016Journal Articlesclosedjournals/computability/Carl1510.3233/COM-160055https://doi.org/10.3233/COM-160055https://dblp.org/rec/journals/computability/Carl15URL#3078358Eric FaberJaap van OostenEffective operations of type 2 in PCAs.Comput.52127-1462016Journal Articlesclosedjournals/computability/FaberO1510.3233/COM-150048https://doi.org/10.3233/COM-150048https://dblp.org/rec/journals/computability/FaberO15URL#3078359Ian HerbertLowness for integer-valued randomness.Comput.52103-1092016Journal Articlesclosedjournals/computability/Herbert1510.3233/COM-150045https://doi.org/10.3233/COM-150045https://dblp.org/rec/journals/computability/Herbert15URL#3078360Denis R. HirschfeldtCarl G. Jockusch Jr.Timothy H. McNichollPaul E. SchuppAsymptotic density and the coarse computability bound.Comput.5113-272016Journal Articlesclosedjournals/computability/HirschfeldtJMS1610.3233/COM-150035https://doi.org/10.3233/COM-150035https://dblp.org/rec/journals/computability/HirschfeldtJMS16URL#3078361Rupert Hölzl 0001Frank Stephan 0001Liang YuOn Martin's pointed tree theorem.Comput.52147-1572016Journal Articlesclosedjournals/computability/HolzlSY1510.3233/COM-150047https://doi.org/10.3233/COM-150047https://dblp.org/rec/journals/computability/HolzlSY15URL#3078362Benedikt LöweBarry Cooper (1943-2015): The engine of Computability in Europe.Comput.513-112016Journal Articlesclosedjournals/computability/Lowe1610.3233/COM-160052https://doi.org/10.3233/COM-160052https://dblp.org/rec/journals/computability/Lowe16URL#3078363Albert A. MuchnikStrong and weak reducibility of algorithmic problems.Comput.5149-592016Journal Articlesclosedjournals/computability/Muchnik1610.3233/COM-150042https://doi.org/10.3233/COM-150042https://dblp.org/rec/journals/computability/Muchnik16URL#3078364Arno PaulyOn the topological aspects of the theory of represented spaces.Comput.52159-1802016Journal Articlesclosedjournals/computability/Pauly1510.3233/COM-150049https://doi.org/10.3233/COM-150049https://dblp.org/rec/journals/computability/Pauly15URL#3078365Eric P. AstorAsymptotic density, immunity and randomness.Comput.42141-1582015Journal Articlesclosedjournals/computability/Astor1510.3233/COM-150040https://doi.org/10.3233/COM-150040https://dblp.org/rec/journals/computability/Astor15URL#3393187Amir M. Ben-AmramMortality of iterated piecewise affine functions over the integers: Decidability and complexity.Comput.4119-562015Journal Articlesclosedjournals/computability/Ben-Amram1510.3233/COM-150032https://doi.org/10.3233/COM-150032https://dblp.org/rec/journals/computability/Ben-Amram15URL#3393188Kirill GuraJeffry L. HirstCarl MummertOn the existence of a connected component of a graph.Comput.42103-1172015Journal Articlesclosedjournals/computability/GuraHM1510.3233/COM-150039https://doi.org/10.3233/COM-150039https://dblp.org/rec/journals/computability/GuraHM15URL#3393189Charles M. HarrisOn limitwise monotonicity and maximal block functions.Comput.42119-1392015Journal Articlesclosedjournals/computability/Harris1510.3233/COM-150037https://doi.org/10.3233/COM-150037https://dblp.org/rec/journals/computability/Harris15URL#3393190Jack H. LutzNeil LutzLines missing every random point.Comput.4285-1022015Journal Articlesclosedjournals/computability/LutzL1510.3233/COM-150038https://doi.org/10.3233/COM-150038https://dblp.org/rec/journals/computability/LutzL15URL#3393191Ludovic PateyThe complexity of satisfaction problems in reverse mathematics.Comput.4169-842015Journal Articlesclosedjournals/computability/Patey1510.3233/COM-150034https://doi.org/10.3233/COM-150034https://dblp.org/rec/journals/computability/Patey15URL#3393192Matthias Schröder 0001Victor L. SelivanovHyperprojective hierarchy of qcb0-spaces.Comput.411-172015Journal Articlesclosedjournals/computability/SchroderS1510.3233/COM-150031https://doi.org/10.3233/COM-150031https://dblp.org/rec/journals/computability/SchroderS15URL#3393193Stanislav O. SperanskiSome new results in monadic second-order arithmetic.Comput.42159-1742015Journal Articlesclosedjournals/computability/Speranski1510.3233/COM-150036https://doi.org/10.3233/COM-150036https://dblp.org/rec/journals/computability/Speranski15URL#3393194Henry TowsnerOn maximum conservative extensions.Comput.4157-682015Journal Articlesclosedjournals/computability/Towsner1510.3233/COM-150033https://doi.org/10.3233/COM-150033https://dblp.org/rec/journals/computability/Towsner15URL#3393195Cristina BazganMorgan ChopinAndré NichterleinFlorian SikoraParameterized Inapproximability of Target Set Selection and Generalizations.Comput.32135-1452014Journal Articlesclosedjournals/computability/BazganCNS1410.3233/COM-140030https://doi.org/10.3233/COM-140030https://dblp.org/rec/journals/computability/BazganCNS14URL#3694737Wesley CalvertValentina S. HarizanovAlexandra ShlapentokhTuring Degrees of Isomorphism Types of Geometric Objects.Comput.32105-1342014Journal Articlesclosedjournals/computability/CalvertHS1410.3233/COM-140029https://doi.org/10.3233/COM-140029https://dblp.org/rec/journals/computability/CalvertHS14URL#3694738Johanna N. Y. FranklinReed SolomonDegrees that Are Low for Isomorphism.Comput.3273-892014Journal Articlesclosedjournals/computability/FranklinS1410.3233/COM-140027https://doi.org/10.3233/COM-140027https://dblp.org/rec/journals/computability/FranklinS14URL#3694739Cameron E. FreerBjørn Kjos-HanssenAndré NiesFrank Stephan 0001Algorithmic Aspects of Lipschitz Functions.Comput.3145-612014Journal Articlesclosedjournals/computability/FreerKNS1410.3233/COM-14025https://doi.org/10.3233/COM-14025https://dblp.org/rec/journals/computability/FreerKNS14URL#3694740Ryan C. HarkinsJohn M. HitchcockAduri PavanStrong Reductions and Isomorphism of Complete Sets.Comput.3291-1042014Journal Articlesclosedjournals/computability/HarkinsHP1410.3233/COM-140028https://doi.org/10.3233/COM-140028https://dblp.org/rec/journals/computability/HarkinsHP14URL#3694741Keng Meng NgAndré NiesFrank Stephan 0001The Complexity of Recursive Splittings of Random Sets.Comput.311-82014Journal Articlesclosedjournals/computability/NgNS1410.3233/COM-14023https://doi.org/10.3233/COM-14023https://dblp.org/rec/journals/computability/NgNS14URL#3694742Stela NikolovaShared thoughts on Ivan Soskov (1954-2013).Comput.3163-722014Journal Articlesclosedjournals/computability/Nikolova1410.3233/COM-14026https://doi.org/10.3233/COM-14026https://dblp.org/rec/journals/computability/Nikolova14URL#3694743John V. TuckerJeffery I. ZuckerComputability of Operators on Continuous and Discrete Time Streams.Comput.319-442014Journal Articlesclosedjournals/computability/TuckerZ1410.3233/COM-14024https://doi.org/10.3233/COM-14024https://dblp.org/rec/journals/computability/TuckerZ14URL#3694744Jacob CarsonJesse JohnsonJulia F. KnightKaren M. LangeCharles F. D. McCoyJohn WallbaumThe Arithmetical Hierarchy in the Setting of ω1.Comput.2293-1052013Journal Articlesclosedjournals/computability/CarsonJKLMW1310.3233/COM-13022https://doi.org/10.3233/COM-13022https://dblp.org/rec/journals/computability/CarsonJKLMW13URL#3985957David DiamondstoneNoam GreenbergDaniel TuretskyNatural Large Degree Spectra.Comput.211-82013Journal Articlesclosedjournals/computability/DiamondstoneGT1310.3233/COM-13008https://doi.org/10.3233/COM-13008https://dblp.org/rec/journals/computability/DiamondstoneGT13URL#3985958Hannes DienerWeak König's Lemma Implies the Uniform Continuity Theorem.Comput.219-132013Journal Articlesclosedjournals/computability/Diener1310.3233/COM-13009https://doi.org/10.3233/COM-13009https://dblp.org/rec/journals/computability/Diener13URL#3985959François G. DoraisJeffry L. HirstPaul ShaferReverse Mathematics and Algebraic Field Extensions.Comput.2275-922013Journal Articlesclosedjournals/computability/DoraisHS1310.3233/COM-13021https://doi.org/10.3233/COM-13021https://dblp.org/rec/journals/computability/DoraisHS13URL#3985960Hartmut EhrigClaudia ErmelFalk HüffnerRolf NiedermeierOlga RungeConfluence in Data Reduction: Bridging Graph Transformation and Kernelization.Comput.2131-492013Journal Articlesclosedjournals/computability/EhrigEHNR1310.3233/COM-13016https://doi.org/10.3233/COM-13016https://dblp.org/rec/journals/computability/EhrigEHNR13URL#3985961Russell G. MillerHans SchoutensComputably Categorical Fields via Fermat's Last Theorem.Comput.2151-652013Journal Articlesclosedjournals/computability/MillerS1310.3233/COM-13017https://doi.org/10.3233/COM-13017https://dblp.org/rec/journals/computability/MillerS13URL#3985962Kenshi MiyabeL1-Computability, Layerwise Computability and Solovay Reducibility.Comput.2115-292013Journal Articlesclosedjournals/computability/Miyabe1310.3233/COM-13015https://doi.org/10.3233/COM-13015https://dblp.org/rec/journals/computability/Miyabe13URL#3985963Shinnosuke SekiYasushi OkunoOn the Behavior of Tile Assembly System at High Temperatures.Comput.22107-1242013Journal Articlesclosedjournals/computability/SekiO1310.3233/COM-13020https://doi.org/10.3233/COM-13020https://dblp.org/rec/journals/computability/SekiO13URL#3985964Dimiter SkordevOn Some Computability Notions for Real Functions.Comput.2167-732013Journal Articlesclosedjournals/computability/Skordev1310.3233/COM-13018https://doi.org/10.3233/COM-13018https://dblp.org/rec/journals/computability/Skordev13URL#3985965Fernando Soler-ToscanoHector ZenilJean-Paul DelahayeNicolas GauvritCorrespondence and Independence of Numerical Evaluations of Algorithmic Information Measures.Comput.22125-1402013Journal Articlesclosedjournals/computability/Soler-ToscanoZDG1310.3233/COM-13019https://doi.org/10.3233/COM-13019https://dblp.org/rec/journals/computability/Soler-ToscanoZDG13URL#3985966Alastair A. AbbottCristian S. CaludeVon Neumann Normalisation of a Quantum Random Number Generator.Comput.1159-832012Journal Articlesclosedjournals/computability/AbbottC1210.3233/COM-2012-001https://doi.org/10.3233/COM-2012-001https://dblp.org/rec/journals/computability/AbbottC12URL#4266127Vasco BrattkaPaola BonizzoniS. Barry CooperBenedikt LöweElvira MayordomoEditorial.Comput.111-22012Journal Articlesclosedjournals/computability/BrattkaBCLM1210.3233/COM-2012-007https://doi.org/10.3233/COM-2012-007https://dblp.org/rec/journals/computability/BrattkaBCLM12URL#4266128Peter CholakDamir D. DzhafarovNoah David SchweberRichard A. ShoreComputably Enumerable Partial Orders.Comput.1299-1072012Journal Articlesclosedjournals/computability/CholakDSS1210.3233/COM-12013https://doi.org/10.3233/COM-12013https://dblp.org/rec/journals/computability/CholakDSS12URL#4266129Samuel CoskeyJoel David HamkinsRussell G. MillerThe Hierarchy of Equivalence Relations on the Natural Numbers Under Computable Reducibility.Comput.1115-382012Journal Articlesclosedjournals/computability/CoskeyHM1210.3233/COM-2012-004https://doi.org/10.3233/COM-2012-004https://dblp.org/rec/journals/computability/CoskeyHM12URL#4266130Denis R. HirschfeldtRebecca WeberFinite Self-Information.Comput.1185-982012Journal Articlesclosedjournals/computability/HirschfeldtW1210.3233/COM-2012-003https://doi.org/10.3233/COM-2012-003https://dblp.org/rec/journals/computability/HirschfeldtW12URL#4266131John M. HitchcockLimitations of Efficient Reducibility to the Kolmogorov Random Strings.Comput.1139-432012Journal Articlesclosedjournals/computability/Hitchcock1210.3233/COM-2012-006https://doi.org/10.3233/COM-2012-006https://dblp.org/rec/journals/computability/Hitchcock12URL#4266132Mathieu HoyrupCristobal RojasKlaus WeihrauchComputability of the Radon-Nikodym Derivative.Comput.113-132012Journal Articlesclosedjournals/computability/HoyrupRW1210.3233/COM-2012-005https://doi.org/10.3233/COM-2012-005https://dblp.org/rec/journals/computability/HoyrupRW12URL#4266133Takayuki KiharaIncomputability of Simply Connected Planar Continua.Comput.12131-1522012Journal Articlesclosedjournals/computability/Kihara1210.3233/COM-12012https://doi.org/10.3233/COM-12012https://dblp.org/rec/journals/computability/Kihara12URL#4266134Alexander P. KreuzerOn the Strength of Weak Compactness.Comput.12171-1792012Journal Articlesclosedjournals/computability/Kreuzer1210.3233/COM-12010https://doi.org/10.3233/COM-12010https://dblp.org/rec/journals/computability/Kreuzer12URL#4266135Wolfgang MerkleJason TeutschConstant Compression and Random Weights.Comput.12153-1692012Journal Articlesclosedjournals/computability/MerkleT1210.3233/COM-12011https://doi.org/10.3233/COM-12011https://dblp.org/rec/journals/computability/MerkleT12URL#4266136Anthony MorphettIncompleteness, Approximation and Relative Randomness.Comput.12109-1302012Journal Articlesclosedjournals/computability/Morphett1210.3233/COM-12014https://doi.org/10.3233/COM-12014https://dblp.org/rec/journals/computability/Morphett12URL#4266137Philipp SchlichtBenjamin SeyfferthTree Representations via Ordinal Machines.Comput.1145-572012Journal Articlesclosedjournals/computability/SchlichtS1210.3233/COM-2012-002https://doi.org/10.3233/COM-2012-002https://dblp.org/rec/journals/computability/SchlichtS12URL#4266138