Search results for "F.1.1"

showing 10 items of 11 documents

Machine $B_4$

2020

We construct map $\xi$. It exhibits dense orbits for all $x\in\overline{0,1}^\omega$. We give elementary proofs for all statements.

20F10 68Q70 20B07:20B35Mathematics - Group TheoryF.1.1
researchProduct

Production of neutron deficient rare isotope beams at IGISOL; on-line and off-line studies

2004

This article reports on recent on-line yield measurements employing the light-ion and heavy-ion reaction-based ion guide systems and new results on a-recoil ion transport properties in ion guides with and without electric fields. In addition, the presently used ion guide designs for fusion evaporation reactions are introduced. The present study investigated different schemes for ion extraction from the gas cell. The addition of an extra ring electrode between the traditional skimmer electrode and the exit hole led to transmission independent of the primary beam intensity as opposed to strong intensity dependence observed earlier with the plain skimmer only. Furthermore, the mass resolving p…

FUSION-EVAPORATION REACTIONSISOMERNuclear and High Energy PhysicsEFFICIENCYIon beamChemistryHF-171Buffer gasion guideElectronIon gunSTATEon-line isotope separationIonION-GUIDE TECHNIQUEIon beam depositionPhysics::Plasma PhysicsNeutronSEPARATOR ONLINEAtomic physicsLASER SPECTROSCOPYSPIGInstrumentationIon transporterNuclear Instruments and Methods in Physics Research Section B: Beam Interactions with Materials and Atoms
researchProduct

Probabilistic and team PFIN-type learning: General properties

2008

We consider the probability hierarchy for Popperian FINite learning and study the general properties of this hierarchy. We prove that the probability hierarchy is decidable, i.e. there exists an algorithm that receives p_1 and p_2 and answers whether PFIN-type learning with the probability of success p_1 is equivalent to PFIN-type learning with the probability of success p_2. To prove our result, we analyze the topological structure of the probability hierarchy. We prove that it is well-ordered in descending ordering and order-equivalent to ordinal epsilon_0. This shows that the structure of the hierarchy is very complicated. Using similar methods, we also prove that, for PFIN-type learning…

FOS: Computer and information sciencesComputer Science::Machine LearningTheoretical computer scienceComputer Networks and CommunicationsExistential quantificationStructure (category theory)DecidabilityType (model theory)Learning in the limitTheoretical Computer ScienceMachine Learning (cs.LG)Probability of successFinite limitsMathematicsOrdinalsDiscrete mathematicsHierarchybusiness.industryApplied MathematicsAlgorithmic learning theoryProbabilistic logicF.1.1 I.2.6Inductive inferenceInductive reasoningDecidabilityComputer Science - LearningTeam learningComputational Theory and MathematicsArtificial intelligencebusinessJournal of Computer and System Sciences
researchProduct

La forma de gobierno en la Constitución de Cádiz (reflexiones sobre la configuración de la Jefatura del Estado monárquica)

2012

A partir de las circunstancias históricas de las Cortes de Cádiz y de los precedentes de la monarquía española, el artículo analiza la posición de la Jefatura del Estado monárquica en la Constitución de 1812 caracterizada como una «Monarquía moderada» basada en los principios estructurales de soberanía nacional y división de poderes que determinan la configuración del Rey como poder constituido en la nueva forma de gobierno. La afirmación de la soberanía nacional impregna el conjunto del texto constitucional sin perjuicio de que coexista retóricamente con la antigua legitimidad monárquica. Por otra parte, la división de poderes supone la distinción entre la titularidad de la soberanía y su …

//udcdata.info/021523 [http]separation of powersSociology and Political ScienceParliamentmedia_common.quotation_subjectsoberanía nacionaldivisión de poderesConstitution of 1812lcsh:Law of EuropeConstitutional monarchyMonarchySovereigntylcsh:Law in general. Comparative and uniform law. Jurisprudencemonarquía parlamentariamedia_commonDret constitucionalDerechoConstitutionhead of statenational sovereigntySeparation of powersConstitucion de 1812lcsh:KJ-KKZArtExecutive branchconstitutional monarchylcsh:K1-7720Executive powerjefatura del estadoLawCartographyHumanities
researchProduct

Topological properties of cellular automata on trees

2012

We prove that there do not exist positively expansive cellular automata defined on the full k-ary tree shift (for k>=2). Moreover, we investigate some topological properties of these automata and their relationships, namely permutivity, surjectivity, preinjectivity, right-closingness and openness.

[INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]FOS: Computer and information sciencesDiscrete Mathematics (cs.DM)Formal Languages and Automata Theory (cs.FL)FOS: Physical sciencesComputer Science - Formal Languages and Automata Theory0102 computer and information sciences[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]Computational Complexity (cs.CC)Topology01 natural scienceslcsh:QA75.5-76.95[INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]0101 mathematicsF.1.1;F.1.2;F.1.3MathematicsCellular Automata and Lattice Gases (nlin.CG)lcsh:Mathematics010102 general mathematicsCellular automaton tree shift expansivity permutivity right-closingness opennesslcsh:QA1-939Nonlinear Sciences::Cellular Automata and Lattice GasesCellular automatonAutomatonComputer Science - Computational Complexity010201 computation theory & mathematicsTree (set theory)lcsh:Electronic computers. Computer scienceF.1.2F.1.3ExpansiveNonlinear Sciences - Cellular Automata and Lattice GasesF.1.1Computer Science::Formal Languages and Automata TheoryComputer Science - Discrete Mathematics
researchProduct

One-counter verifiers for decidable languages

2012

Condon and Lipton (FOCS 1989) showed that the class of languages having a space-bounded interactive proof system (IPS) is a proper subset of decidable languages, where the verifier is a probabilistic Turing machine. In this paper, we show that if we use architecturally restricted verifiers instead of restricting the working memory, i.e. replacing the working tape(s) with a single counter, we can define some IPS's for each decidable language. Such verifiers are called two-way probabilistic one-counter automata (2pca's). Then, we show that by adding a fixed-size quantum memory to a 2pca, called a two-way one-counter automaton with quantum and classical states (2qcca), the protocol can be spac…

FOS: Computer and information sciencesComputer Science - Computational ComplexityQuantum PhysicsTheoryofComputation_COMPUTATIONBYABSTRACTDEVICESFormal Languages and Automata Theory (cs.FL)FOS: Physical sciencesF.1.1; F.1.2Computer Science - Formal Languages and Automata TheoryF.1.2Computational Complexity (cs.CC)Quantum Physics (quant-ph)F.1.1Computer Science::Formal Languages and Automata Theory
researchProduct

Functions definable by numerical set-expressions

2011

A "numerical set-expression" is a term specifying a cascade of arithmetic and logical operations to be performed on sets of non-negative integers. If these operations are confined to the usual Boolean operations together with the result of lifting addition to the level of sets, we speak of "additive circuits". If they are confined to the usual Boolean operations together with the result of lifting addition and multiplication to the level of sets, we speak of "arithmetic circuits". In this paper, we investigate the definability of sets and functions by means of additive and arithmetic circuits, occasionally augmented with additional operations.

FOS: Computer and information sciencesComputer Science - Logic in Computer ScienceLogic0102 computer and information sciences01 natural sciencesTheoretical Computer Scienceexpressive powerSet (abstract data type)integer expressionArts and Humanities (miscellaneous)Saturation arithmeticBoolean expression0101 mathematicsElectronic circuitMathematics010102 general mathematicsTerm (logic)Logic in Computer Science (cs.LO)AlgebraArithmetic circuitdefinability010201 computation theory & mathematicsHardware and ArchitectureCascadeAlgebraic operationMultiplicationF.1.1SoftwareJournal of Logic and Computation
researchProduct

Polityczna i militarna batalia o przyłączenie Wielkopolski do Polski po I wojnie światowej na kartach podręczników do nauczania historii. Casus polsk…

2020

In the opinion o f the vast majority o f historians, school histoiy education is extremely important. They emphasize that it plays a key role not only from the point ofview ofshaping the knowledge ofyoung people about the past, but also in defining the historical awareness o f the whole society, because often what students learn at school determines their lifelong knowledge o f many historical issues. Unfortunately, the awareness o f these obvious statements does not go hand in hand with respect for the achierements o f history didactics. As a scientific discipline, history didactics undertakes as one o f its most important research areas the analysis o f school history textbooks which are …

history school textbooksmethodology of history didacticsThe Second Polish Republicparyska konferencja pokojowaszkolne podręczniki do nauczania historiiThe Greater Poland uprising of 1918-1919dydaktyka historiiParis Peace ConferenceDruga RzeczpospolitaPowstanie wielkopolskie (1918-1919)Przegląd Zachodni
researchProduct

LES ÉQUIVOQUES DU « CONSTITUTIONNALISME OCTROYÉ » : UN DÉBAT TRANSATLANTIQUE (I)

2015

In Portugal and in its former colonies, the expression "constitucionalismo outorgado » is part of the constitutional vocabulary since the granting of the Charter of 1826. The French inspiration is obvious ; however, no equivalent expression exists in France. This curiosity leads to measure all the ambiguity of the concept of "granted constitutionalism", an improbable oxymoron according to the president of the Portuguese Republic, Teófilo Braga. Is it about a simple political and linguistic claim, a temporary compromise at the end of a frustrated Revolution? Or does it translate a deeper program, to reconcile both sides of the constitutionalism, ancient and modern ?

constitutionalism (ancient and modern)constitutionnalisme (ancien et moderne)Historygranted constitutionalismSociology and Political ScienceMixed government[SHS.DROIT] Humanities and Social Sciences/LawFear of Godmedia_common.quotation_subjectIdentity (social science)ConstitutionalismPolitics[SHS.DROIT]Humanities and Social Sciences/LawCharte française de 1814French Charter of 1814Sociologymedia_commonconstituent powerConstitutionDoctrinepouvoir constituant.Numinousportuguese Charter of 1826Charte portugaise de 1826LawPolitical Science and International Relationsconstitutionnalisme octroyéLaw
researchProduct

L'Abolizione della feudalità e il culto degli onori nella Sicilia del 1812

2015

La Costituzione del 1812 trasformò i feudi in allodi ed eliminò le giurisdizioni feudali. L’obiettivo, già auspicato da Caracciolo e Caramanico, fu raggiunto solamente in un momento particolare della storia siciliana e grazie all’intervento del plenipotenziario inglese Sir Bentinck l’istituto giuridico fu abolito. Tuttavia la rappresentazione della nobiltà come categoria non scomparve e rimase saldamente presente nell’immaginario collettivo. Il titolo nobiliare e l’onore ad esso collegato, costituirono l’elemento sociologico-strutturale sul quale si assestò la politica di difesa cetuale del baronaggio. Alcuni esempi di come si costruisce l’onore di un casato, completano questo primo approcc…

Costituzione del 1812 nobiltà siciliana onoreConstitution of 1812 Sicilian nobility honor.Settore M-STO/02 - Storia Moderna
researchProduct