Computability on random variables
Identifieur interne : 000B69 ( Istex/Corpus ); précédent : 000B68; suivant : 000B70Computability on random variables
Auteurs : Norbert Th. MüllerSource :
- Theoretical Computer Science [ 0304-3975 ] ; 1999.
Abstract
In this paper, we study aspects of computability concerning random variables under the background of Type 2 Theory of Effectivity (TTE). We show that the resulting definitions are “natural” as they suffice to successfully discuss questions of computability of basic queueing systems, e.g. of the so-called M/G/1-system.
Url:
DOI: 10.1016/S0304-3975(98)00292-8
Links to Exploration step
ISTEX:1FF96399C45AE4DFAE1EB26258706FF8BC8220BELe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title>Computability on random variables</title><author><name sortKey="Muller, Norbert Th" sort="Muller, Norbert Th" uniqKey="Muller N" first="Norbert Th." last="Müller">Norbert Th. Müller</name><affiliation><mods:affiliation>LG Stochastische Modellierung und Rechnernetze, FB IV-Informatik, University of Trier, D-54286 Trier, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: mueller@uni-trier.de</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:1FF96399C45AE4DFAE1EB26258706FF8BC8220BE</idno><date when="1999" year="1999">1999</date><idno type="doi">10.1016/S0304-3975(98)00292-8</idno><idno type="url">https://api.istex.fr/document/1FF96399C45AE4DFAE1EB26258706FF8BC8220BE/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000B69</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000B69</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a">Computability on random variables</title><author><name sortKey="Muller, Norbert Th" sort="Muller, Norbert Th" uniqKey="Muller N" first="Norbert Th." last="Müller">Norbert Th. Müller</name><affiliation><mods:affiliation>LG Stochastische Modellierung und Rechnernetze, FB IV-Informatik, University of Trier, D-54286 Trier, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: mueller@uni-trier.de</mods:affiliation></affiliation></author></analytic><monogr></monogr><series><title level="j">Theoretical Computer Science</title><title level="j" type="abbrev">TCS</title><idno type="ISSN">0304-3975</idno><imprint><publisher>ELSEVIER</publisher><date type="published" when="1999">1999</date><biblScope unit="volume">219</biblScope><biblScope unit="issue">1–2</biblScope><biblScope unit="page" from="287">287</biblScope><biblScope unit="page" to="299">299</biblScope></imprint><idno type="ISSN">0304-3975</idno></series><idno type="istex">1FF96399C45AE4DFAE1EB26258706FF8BC8220BE</idno><idno type="DOI">10.1016/S0304-3975(98)00292-8</idno><idno type="PII">S0304-3975(98)00292-8</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0304-3975</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">In this paper, we study aspects of computability concerning random variables under the background of Type 2 Theory of Effectivity (TTE). We show that the resulting definitions are “natural” as they suffice to successfully discuss questions of computability of basic queueing systems, e.g. of the so-called M/G/1-system.</div></front></TEI><istex><corpusName>elsevier</corpusName><author><json:item><name>Norbert Th. Müller</name><affiliations><json:string>LG Stochastische Modellierung und Rechnernetze, FB IV-Informatik, University of Trier, D-54286 Trier, Germany</json:string><json:string>E-mail: mueller@uni-trier.de</json:string></affiliations></json:item></author><language><json:string>eng</json:string></language><originalGenre><json:string>Full-length article</json:string></originalGenre><abstract>In this paper, we study aspects of computability concerning random variables under the background of Type 2 Theory of Effectivity (TTE). We show that the resulting definitions are “natural” as they suffice to successfully discuss questions of computability of basic queueing systems, e.g. of the so-called M/G/1-system.</abstract><qualityIndicators><score>4.671</score><pdfVersion>1.2</pdfVersion><pdfPageSize>468 x 684 pts</pdfPageSize><refBibsNative>true</refBibsNative><keywordCount>0</keywordCount><abstractCharCount>319</abstractCharCount><pdfWordCount>4107</pdfWordCount><pdfCharCount>24490</pdfCharCount><pdfPageCount>13</pdfPageCount><abstractWordCount>47</abstractWordCount></qualityIndicators><title>Computability on random variables</title><pii><json:string>S0304-3975(98)00292-8</json:string></pii><refBibs><json:item><host><author></author><title>Taschenbuch der Mathematik</title></host></json:item><json:item><host><author></author><title>Introduction to Stochastic Processes</title></host></json:item><json:item><host><author></author><title>Queueing Systems</title></host></json:item><json:item><author><json:item><name>N.Th. Müller</name></json:item></author><host><pages><last>281</last><first>259</first></pages><author></author><title>Proc. 22 JAIIO — PANEL '93</title></host><title>Polynomial time computation of Taylor series</title></json:item><json:item><author></author><host><author></author><title>also available at</title></host><title>also available at</title></json:item><json:item><host><author></author><title>Probability, Stochastic Processes, and Queueing Theory</title></host></json:item><json:item><host><author></author></host></json:item><json:item><host><author></author></host></json:item><json:item><host><author></author></host></json:item></refBibs><genre><json:string>research-article</json:string></genre><host><volume>219</volume><pii><json:string>S0304-3975(00)X0110-7</json:string></pii><pages><last>299</last><first>287</first></pages><issn><json:string>0304-3975</json:string></issn><issue>1–2</issue><genre><json:string>journal</json:string></genre><language><json:string>unknown</json:string></language><title>Theoretical Computer Science</title><publicationDate>1999</publicationDate></host><categories><wos><json:string>science</json:string><json:string>computer science, theory & methods</json:string></wos><scienceMetrix><json:string>applied sciences</json:string><json:string>information & communication technologies</json:string><json:string>computation theory & mathematics</json:string></scienceMetrix></categories><publicationDate>1999</publicationDate><copyrightDate>1999</copyrightDate><doi><json:string>10.1016/S0304-3975(98)00292-8</json:string></doi><id>1FF96399C45AE4DFAE1EB26258706FF8BC8220BE</id><score>1.4792902</score><fulltext><json:item><extension>pdf</extension><original>true</original><mimetype>application/pdf</mimetype><uri>https://api.istex.fr/document/1FF96399C45AE4DFAE1EB26258706FF8BC8220BE/fulltext/pdf</uri></json:item><json:item><extension>zip</extension><original>false</original><mimetype>application/zip</mimetype><uri>https://api.istex.fr/document/1FF96399C45AE4DFAE1EB26258706FF8BC8220BE/fulltext/zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/document/1FF96399C45AE4DFAE1EB26258706FF8BC8220BE/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a">Computability on random variables</title></titleStmt><publicationStmt><authority>ISTEX</authority><publisher>ELSEVIER</publisher><availability><p>ELSEVIER</p></availability><date>1999</date></publicationStmt><notesStmt><note type="content">Section title: Contribution</note></notesStmt><sourceDesc><biblStruct type="inbook"><analytic><title level="a">Computability on random variables</title><author xml:id="author-1"><persName><forename type="first">Norbert Th.</forename><surname>Müller</surname></persName><email>mueller@uni-trier.de</email><affiliation>LG Stochastische Modellierung und Rechnernetze, FB IV-Informatik, University of Trier, D-54286 Trier, Germany</affiliation></author></analytic><monogr><title level="j">Theoretical Computer Science</title><title level="j" type="abbrev">TCS</title><idno type="pISSN">0304-3975</idno><idno type="PII">S0304-3975(00)X0110-7</idno><imprint><publisher>ELSEVIER</publisher><date type="published" when="1999"></date><biblScope unit="volume">219</biblScope><biblScope unit="issue">1–2</biblScope><biblScope unit="page" from="287">287</biblScope><biblScope unit="page" to="299">299</biblScope></imprint></monogr><idno type="istex">1FF96399C45AE4DFAE1EB26258706FF8BC8220BE</idno><idno type="DOI">10.1016/S0304-3975(98)00292-8</idno><idno type="PII">S0304-3975(98)00292-8</idno></biblStruct></sourceDesc></fileDesc><profileDesc><creation><date>1999</date></creation><langUsage><language ident="en">en</language></langUsage><abstract xml:lang="en"><p>In this paper, we study aspects of computability concerning random variables under the background of Type 2 Theory of Effectivity (TTE). We show that the resulting definitions are “natural” as they suffice to successfully discuss questions of computability of basic queueing systems, e.g. of the so-called M/G/1-system.</p></abstract></profileDesc><revisionDesc><change when="1999">Published</change></revisionDesc></teiHeader></istex:fulltextTEI><json:item><extension>txt</extension><original>false</original><mimetype>text/plain</mimetype><uri>https://api.istex.fr/document/1FF96399C45AE4DFAE1EB26258706FF8BC8220BE/fulltext/txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="Elsevier, elements deleted: tail"><istex:xmlDeclaration>version="1.0" encoding="utf-8"</istex:xmlDeclaration><istex:docType PUBLIC="-//ES//DTD journal article DTD version 4.5.2//EN//XML" URI="art452.dtd" name="istex:docType"></istex:docType><istex:document><converted-article version="4.5.2" docsubtype="fla"><item-info><jid>TCS</jid><aid>98002928</aid><ce:pii>S0304-3975(98)00292-8</ce:pii><ce:doi>10.1016/S0304-3975(98)00292-8</ce:doi><ce:copyright type="unknown" year="1999"></ce:copyright></item-info><head><ce:dochead><ce:textfn>Contribution</ce:textfn></ce:dochead><ce:title>Computability on random variables</ce:title><ce:author-group><ce:author><ce:given-name>Norbert Th.</ce:given-name><ce:surname>Müller</ce:surname><ce:e-address>mueller@uni-trier.de</ce:e-address></ce:author><ce:affiliation><ce:textfn>LG Stochastische Modellierung und Rechnernetze, FB IV-Informatik, University of Trier, D-54286 Trier, Germany</ce:textfn></ce:affiliation></ce:author-group><ce:abstract><ce:section-title>Abstract</ce:section-title><ce:abstract-sec><ce:simple-para>In this paper, we study aspects of computability concerning random variables under the background of Type 2 Theory of Effectivity (TTE). We show that the resulting definitions are “natural” as they suffice to successfully discuss questions of computability of basic queueing systems, e.g. of the so-called M/G/1-system.</ce:simple-para></ce:abstract-sec></ce:abstract></head></converted-article></istex:document></istex:metadataXml><mods version="3.6"><titleInfo><title>Computability on random variables</title></titleInfo><titleInfo type="alternative" contentType="CDATA"><title>Computability on random variables</title></titleInfo><name type="personal"><namePart type="given">Norbert Th.</namePart><namePart type="family">Müller</namePart><affiliation>LG Stochastische Modellierung und Rechnernetze, FB IV-Informatik, University of Trier, D-54286 Trier, Germany</affiliation><affiliation>E-mail: mueller@uni-trier.de</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre type="research-article" displayLabel="Full-length article"></genre><originInfo><publisher>ELSEVIER</publisher><dateIssued encoding="w3cdtf">1999</dateIssued><copyrightDate encoding="w3cdtf">1999</copyrightDate></originInfo><language><languageTerm type="code" authority="iso639-2b">eng</languageTerm><languageTerm type="code" authority="rfc3066">en</languageTerm></language><physicalDescription><internetMediaType>text/html</internetMediaType></physicalDescription><abstract lang="en">In this paper, we study aspects of computability concerning random variables under the background of Type 2 Theory of Effectivity (TTE). We show that the resulting definitions are “natural” as they suffice to successfully discuss questions of computability of basic queueing systems, e.g. of the so-called M/G/1-system.</abstract><note type="content">Section title: Contribution</note><relatedItem type="host"><titleInfo><title>Theoretical Computer Science</title></titleInfo><titleInfo type="abbreviated"><title>TCS</title></titleInfo><genre type="journal">journal</genre><originInfo><dateIssued encoding="w3cdtf">19990528</dateIssued></originInfo><identifier type="ISSN">0304-3975</identifier><identifier type="PII">S0304-3975(00)X0110-7</identifier><part><date>19990528</date><detail type="volume"><number>219</number><caption>vol.</caption></detail><detail type="issue"><number>1–2</number><caption>no.</caption></detail><extent unit="issue pages"><start>1</start><end>512</end></extent><extent unit="pages"><start>287</start><end>299</end></extent></part></relatedItem><identifier type="istex">1FF96399C45AE4DFAE1EB26258706FF8BC8220BE</identifier><identifier type="DOI">10.1016/S0304-3975(98)00292-8</identifier><identifier type="PII">S0304-3975(98)00292-8</identifier><recordInfo><recordContentSource>ELSEVIER</recordContentSource></recordInfo></mods></metadata><serie></serie></istex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000B69 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 000B69 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Rhénanie
|area= UnivTrevesV1
|flux= Istex
|étape= Corpus
|type= RBID
|clé= ISTEX:1FF96399C45AE4DFAE1EB26258706FF8BC8220BE
|texte= Computability on random variables
}}
| This area was generated with Dilib version V0.6.31. |  |