Search results for "NSPACE"

showing 5 items of 5 documents

The computational power of continuous time neural networks

1997

We investigate the computational power of continuous-time neural networks with Hopfield-type units. We prove that polynomial-size networks with saturated-linear response functions are at least as powerful as polynomially space-bounded Turing machines.

TheoryofComputation_COMPUTATIONBYABSTRACTDEVICESQuantitative Biology::Neurons and CognitionComputational complexity theoryArtificial neural networkComputer sciencebusiness.industryComputer Science::Neural and Evolutionary ComputationNSPACEComputational resourcePower (physics)Turing machinesymbols.namesakeCellular neural networksymbolsArtificial intelligenceTypes of artificial neural networksbusiness
researchProduct

Space-Efficient 1.5-Way Quantum Turing Machine

2001

1.5QTM is a sort of QTM (Quantum Turing Machine) where the head cannot move left (it can stay where it is and move right). For computations is used other - work tape. In this paper will be studied possibilities to economize work tape space more than the same deterministic Turing Machine can do (for some of the languages). As an example language (0i1i|i ≥ 0) is chosen, and is proved that this language could be recognized by deterministic Turing machine using log(i) cells on work tape , and 1.5QTM can recognize it using constant cells quantity.

TheoryofComputation_COMPUTATIONBYABSTRACTDEVICESTheoretical computer scienceQuantum Turing machineSuper-recursive algorithmComputer scienceProbabilistic Turing machineComputationDescription numberMultitape Turing machineDSPACElaw.inventionTuring machinesymbols.namesakeNon-deterministic Turing machinelawAlgorithm characterizationsPSPACEWolfram's 2-state 3-symbol Turing machineTuring machine examplesNSPACETuring reductionsymbolsUniversal Turing machineTime hierarchy theoremAlternating Turing machineRegister machine
researchProduct

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

Minimal nontrivial space complexity of probabilistic one- way turing machines

2005

Languages recognizable in o(log log n) space by probabilistic one — way Turing machines are proved to be regular. This solves an open problem in [4].

Discrete mathematicsTheoryofComputation_COMPUTATIONBYABSTRACTDEVICESSuper-recursive algorithmProbabilistic Turing machineLinear speedup theoremNSPACEDescription numberCombinatoricsTuring machinesymbols.namesakeTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESNon-deterministic Turing machinesymbolsTime hierarchy theoremComputer Science::Formal Languages and Automata TheoryMathematics
researchProduct

Community garden initiatives addressing health and well‐being outcomes: A systematic review of infodemiology aspects, outcomes, and target populations

2021

Previous research has suggested that activities such as community gardens could offer a wide range of health benefits. The aim of the article is to systematically review the available literature to analyse the magnitude of the phenomenon, the geographical distribution, and the main characteristics in terms of health outcomes and target populations. The search addresses the question whether the activity in community gardens improves health and well-being outcomes of individuals. From the total amount of 7226, 84 selected articles showed that:(1) up to 50% are published by U.S. universities or institutions; (2) up to 44% of the studies considered “community gardens” as the main activity of th…

GerontologyAdultmedicine.medical_specialtyHealth Toxicology and Mutagenesismedia_common.quotation_subjectDistribution (economics)lcsh:Medicine010501 environmental sciences01 natural sciencesOutcome (game theory)Infodemiology03 medical and health sciences0302 clinical medicinePromotion (rank)well-beingPhenomenonmedicineHumans030212 general & internal medicine0105 earth and related environmental sciencesmedia_commonSettore MED/14 - NefrologiaWell‐beingPublic healthbusiness.industryPublic healthlcsh:RPublic Health Environmental and Occupational HealthUrban HealthGardeningCommunity gardens; Health promotion; Public health; Urban greenspace; Well‐being; Adult; Humans; Urban Health; Gardening; GardensSettore AGR/03 - Arboricoltura Generale E Coltivazioni ArboreeHealth promotionCommunity gardens Health promotion Public health Urban greenspace Well‐beingWell-beingHealth promotionUrban greenspaceSystematic ReviewCommunity gardensPsychologybusinessGardens
researchProduct