Search results for "COMPLETENESS"

showing 10 items of 66 documents

Quantum Real - Time Turing Machine

2001

The principles of quantum computation differ from the principles of classical computation very much. Quantum analogues to the basic constructions of the classical computation theory, such as Turing machine or finite 1-way and 2-ways automata, do not generalize deterministic ones. Their capabilities are incomparable. The aim of this paper is to introduce a quantum counterpart for real - time Turing machine. The recognition of a special kind of language, that can't be recognized by a deterministic real - time Turing machine, is shown.

TheoryofComputation_COMPUTATIONBYABSTRACTDEVICESTheoretical computer scienceQuantum Turing machineDTIMEComputer scienceProbabilistic Turing machine2-EXPTIMESuper-recursive algorithmComputationDescription numberDSPACElaw.inventionsymbols.namesakeTuring machineTuring completenessNon-deterministic Turing machinelawAlgorithm characterizationsQuantumPSPACEQuantum computerFinite-state machineTuring machine examplesNSPACETheoryofComputation_GENERALAutomatonTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESTuring reductionTheory of computationsymbolsUniversal Turing machineTime hierarchy theoremAlternating Turing machineComputer Science::Formal Languages and Automata TheoryRegister machine
researchProduct

Logic, Computing and Biology

2015

Logic and Computing are appropriate formal languages for Biology, and we may well be surprised by the strong analogy between software and DNA, and between hardware and the protein machinery of the cell. This chapter examines to what extent any biological entity can be described by an algorithm and, therefore, whether the Turing machine and the halting problem concepts apply. Last of all, I introduce the concepts of recursion and algorithmic complexity, both from the field of computer science, which can help us understand and conceptualise biological complexity.

Turing machinesymbols.namesakeRecursionTheoretical computer scienceComputer scienceComputational logicFormal languagesymbolsAnalogyComputerApplications_COMPUTERSINOTHERSYSTEMSGödel's incompleteness theoremsUnconventional computingHalting problem
researchProduct

Inductive inference of recursive functions: Qualitative theory

2005

This survey contains both old and very recent results in non-quantitative aspects of inductive inference of total recursive functions. The survey is not complete. The paper was written to stress some of the main results in selected directions of research performed at the University of Latvia rather than to exhaust all of the obtained results. We concentrated on the more explored areas such as the inference of indices in non-Goedel computable numberings, the inference of minimal Goedel numbers, and the specifics of inference of minimal indices in Kolmogorov numberings.

Turing machinesymbols.namesakeTheoretical computer scienceInductive biasInductive probabilitysymbolsRecursive functionsInferenceInductive reasoningGödel's incompleteness theoremsQualitative theoryMathematics
researchProduct

Extrapolation des inventaires de biodiversité incomplets : comment estimer au mieux le nombre d’espèces manquantes et prévoir l’effort additionnel d’…

2016

While approaching or even reaching total completeness remains the idealgoal of any species inventory, incomplete samplings are deemed to become more often the rule, that are significantly more difficult to cope with (such as (micro-) invertebrates, for example).However, once post-operated appropriately, incomplete samplings may provide farmore data than it would seem and it is indeed possible to obtain valuable extra information froma reliable mode of extrapolation of the so-called Species Accumulation Curve.In fact, numerous tools designed for the exploitation of incomplete samplings havealready been proposed in the literature but the concern, with these numerous different tools, isprecise…

[ SDV.BID ] Life Sciences [q-bio]/Biodiversityrichesse spécifiqueéchantillonnage incompletestimationextrapolationInventaireChaoestimatorcompletenessSpecies Accumulation CurveCourbe d’Accumulation des EspècesJackknifeincomplete samplingspecies richnessSurvey[SDV.BID] Life Sciences [q-bio]/Biodiversity
researchProduct

Extrapolation of the Species Accumulation Curve for Incomplete Species Samplings: A New Nonparametric Approach to Estimate the Degree of Sample Compl…

2015

9 pages; International audience; Incomplete species samplings are deemed to remain the common practice in those groups of animals, such as small or micro- invertebrates, with numerous species that often are more or less difficult to detect in the field. Thus, extrapolating the Species Accumulation Curve as far as possible beyond the actual sample size may thus serve as a useful (although imperfect) surrogate to the desired, but practically inaccessible, complete samplings. In this context, several kinds of theoretical or empirical models for the Species Accumulation Curve and also a lot of estimators of the asymptotic limit of the Curve (i.e. total species richness) have been proposed. The …

[STAT.AP]Statistics [stat]/Applications [stat.AP][ SDE.BE ] Environmental Sciences/Biodiversity and Ecologyspecies accumulation curveSpecies discovery curve[ STAT.AP ] Statistics [stat]/Applications [stat.AP]ExtrapolationNonparametric statisticsExtrapolationChao estimatorSampling (statistics)Sample (statistics)General Biochemistry Genetics and Molecular Biologystop samplingjackknifeStatisticsnon-parametricPoint estimationSpecies richness[SDE.BE]Environmental Sciences/Biodiversity and Ecologypoint estimationspecies richnessGeneral Agricultural and Biological SciencesJackknife resamplingsample completenessMathematicsAnnual Research & Review in Biology
researchProduct

$PT$-symmetric graphene under a magnetic field

2016

We propose a $PT$-symmetrically deformed version of the graphene tight-binding model under a magnetic field. We analyze the structure of the spectra and the eigenvectors of the Hamiltonians around the $K$ and $K'$ points, both in the $PT$-symmetric and $PT$-broken regions. In particular we show that the presence of the deformation parameter $V$ produces several interesting consequences, including the asymmetry of the zero-energy states of the Hamiltonians and the breakdown of the completeness of the eigenvector sets. We also discuss the biorthogonality of the eigenvectors, which {turns out to be} different in the $PT$-symmetric and $PT$-broken regions.

deformed grapheneGeneral Mathematicsmedia_common.quotation_subjectMathematicsofComputing_GENERALStructure (category theory)General Physics and AstronomyFOS: Physical sciencesDeformation (meteorology)01 natural sciencesAsymmetrySpectral linelaw.inventionTheoretical physicslawCompleteness (order theory)0103 physical sciencesMesoscale and Nanoscale Physics (cond-mat.mes-hall)biorthogonal eigenstate010306 general physicsSettore MAT/07 - Fisica MatematicaEigenvalues and eigenvectorsResearch ArticlesMathematical Physicsmedia_commonPhysicsCondensed Matter - Mesoscale and Nanoscale Physics010308 nuclear & particles physicsGrapheneGeneral Engineering-symmetric HamiltonianMathematical Physics (math-ph)Magnetic field
researchProduct

El papel de la sensación de inacabado y las experiencias "Not Just Right" en el trastorno obsesivo compulsivo. Una aproximación experimental al estud…

2017

La investigación y la práctica clínica han demostrado que el Trastorno Obsesivo-Compulsivo (TOC) es una condición psicopatológica compleja y heterogénea desde el punto de vista etiológico y sintomatológico. Desde hace décadas, un importante cuerpo de investigaciones ha centrado sus esfuerzos en intentar determinar las variables involucradas en el inicio y mantenimiento de la sintomatología obsesivo-compulsiva. La mayoría de estos estudios se han llevado a cabo siguiendo la propuesta de los modelos teóricos cognitivo-conductuales, según los cuales el motivador subyacente a la sintomatología obsesivo-compulsiva es la evitación del daño o miedo a las consecuencias temidas. Concretamente, una g…

evitación del dañosensación de inacabadotrastorno obsesivo compulsivo:PSICOLOGÍA [UNESCO]tocUNESCO::PSICOLOGÍAincompletenessmotivadores de síntomasnot just right experiencies
researchProduct

Introduction to Mathematical Logic (Edition 2017)

2017

Hyper-textbook for students in mathematical logic, Edition 2017

first order logiclogicresolution methodpredicate logicMathematicsofComputing_GENERALresolutionintuitionistic logicHerbrand theorempropositional logicmodel theoryconstructive logicData_FILESComputingMilieux_COMPUTERSANDEDUCATIONnormal formsmathematical logicHardware_ARITHMETICANDLOGICSTRUCTUREScompleteness theorem
researchProduct

Formālisms kā reālās matemātikas filozofija: 14 argumenti

2015

Referāts Latvijas Universitātes 73.zinātniskajā konferencē 2015.gada 13.februārī.

formalismfoundations of mathematics:MATHEMATICS [Research Subject Categories]:HUMANITIES and RELIGION [Research Subject Categories]incompleteness theoremsaxiomatic set theoryplatonism
researchProduct

What is Mathematics: Gödel's Theorem and Around (Edition 2015)

2015

Hyper-textbook for students in mathematical logic and foundations of mathematics. Edition 2015.

foundations of mathematics:MATHEMATICS [Research Subject Categories]MathematicsofComputing_GENERALComputingMilieux_COMPUTERSANDEDUCATIONincompleteness theoremsmathematical logicaxiomatic set theoryHilbert's Tenth problemfirst order arithmetic
researchProduct