Geometry.Net - the online learning center
Home  - Scientists - Rado Tibor

e99.com Bookstore
  
Images 
Newsgroups
Page 2     21-40 of 92    Back | 1  | 2  | 3  | 4  | 5  | Next 20
A  B  C  D  E  F  G  H  I  J  K  L  M  N  O  P  Q  R  S  T  U  V  W  X  Y  Z  

         Rado Tibor:     more detail
  1. Length and Area (Colloquium Publications) by Tibor Rado, 1948-12-31
  2. On the Problem of Plateau (Ergebnisse der Mathematik und ihrer Grenzgebiete) by Tibor Rado, 1951
  3. The Problem of Plateau: A Tribute to Jesse Douglas & Tibor Rado
  4. University of Szeged Alumni: Attila József, Katalin Juhász, Peter Heszler, Zoltan Balog, Camille Sandorfy, Tibor Radó, Gábor Fodor, István Bibó
  5. SUBHARMONIC FUNCTIONS (Ergebnisse Der Mathematik Und Ihrer Grenzgebiete band 1) by Tibor Rado, 1949
  6. On the problem of plateau. by Tibor Radó, 1951
  7. Length and Area American Mathematical Society Colloquim Publications Volume XXX by Tibor Rado, 1948
  8. Continuous Transformations in Analysis: With an Introduction to Algebraic Topology (Grundlehren der mathematischen Wissenschaften) by Tibor Rado, Paul V. Reichelderfer, 1955-01-01
  9. Magnetism: A Treatise on Modern Theory and Materials, Vol. 2B: Interactions and Metals
  10. ON THE PROBLEM OF PLATEAU. by Tibor Rado., 1933
  11. On the problem of Plateau [and] Subharmonic functions by Tibor Rado, 1971
  12. Continuous transformations in analysis: With an introduction to algebraic topology (Grundlehren der mathematischen Wissenschaften) by Tibor Rado, 1955
  13. Magnetism: A treatise on modern theory and materials by George Tibor Rado, 1963

21. Turing-Berechenbarkeit
Translate this page Interessanter sind Turing-Maschinen, die irgendwann einmal anhalten. 1982 dachtesich der ungarische Mathematiker tibor rado das busy beaver Problem aus
http://www.informatik.fh-hamburg.de/~voeller/th/thinf/node16.html

[ Inhalt ] [ Index ]
Next: Church-Turing-These Up: Turing-Maschinen Previous: Spezielle Turing-Maschinen
Turing-Berechenbarkeit
Den Begriff berechenbar haben wir bereits kennengelernt. Eine Funktion f war berechenbar, wenn ein Algorithmus existierte, der für jedes Argument x von f f x ) berechnen konnte.
Jede Turing-Maschine implementiert einen Algorithmus. In Kürze werden wir uns überlegen, daß auch umgekehrt jeder Algorithmus durch eine Turing-Maschine beschrieben werden kann. Wir formulieren die Berechenbarkeit nun für Turing-Maschinen.
Definition: (Turing-Berechenbarkeit
Eine Funktion heißt Turing-berechenbar, wenn eine Turing-Maschine existiert, die angesetzt auf die Bandinschrift nach endlich vielen Schritten auf dem ersten Zeichen von stehenbleibt. Die und sind dabei in unärer Darstellung.
Aufgabe:
Zeigen Sie, daß die Nachfolgerfunktion SUCC x ) und die Addition ADD x y ) Turing-berechenbar sind!
Wir wissen bereits, daß es viele Funktionen gibt, die nicht berechenbar sind. Im nächsten Abschnitt werden wir eine weitere Funktion kennenlernen, die nicht berechenbar ist. Wir verwenden die Begriff berechenbar und Turing-berechenbar synonym.

22. Index For The Letter R
rado, tibor; Radzik,Tomasz; Ragde, Prabhakar; Raghavachari, Balaji; Raghavan, Prabhakar;
http://sigact.acm.org/genealogy/index-R.html
This is the index into entries in the TCS Genealogy for names beginning with the letter R.
  • Rabani, Yuval
  • Rabin, Michael O.
  • Rabinovich, Alexander
  • Rackoff, Charles ...
  • Ryll-Nardzewski, Czeslaw

    • 23. The Mathematics Genealogy Project - Index Of R
    Radner, Michael, University of MinnesotaMinneapolis, 1968. Radnitz, Alan, Universityof California, Los Angeles, 1970. rado, tibor, University of Szeged, 1922.
    http://genealogy.math.ndsu.nodak.edu/html/letter.phtml?letter=R&fShow=1

    24. The Mathematics Genealogy Project - Index Of R
    Radnitz, Alan, University of California, Los Angeles, 1970. rado, tibor, Universityof Szeged, 1922. rado, Richard, Universität Berlin, Cambridge University, 1933.
    http://genealogy.mathematik.uni-bielefeld.de/html/letter.phtml?letter=R&fShow=1

    25. Les 23 Problèmes De Hilbert
    Translate this page nécessairement analytiques. Rép résolu positivement, S. N. Bernsteinet tibor rado,1929, complété par IG Petrovski, 1939.
    http://www.sciences-en-ligne.com/momo/chronomath/anx1/pb23_hilbert.html
    Hilbert
    Millennium Prize Problems Cantor
    non,
    Cohen
    non,
    Hilbert
    A quelles conditions (minimales), un groupe topologique de transformations est-il un groupe de Lie
    groupe topologique     localement euclidien est un groupe de Lie Peut-on axiomatiser la physique ?
    transcendance     de certains nombres,
    non nul et distinct de 1, et b b est-il transcendant ?
    Gelfond     Schneider et Baker Prouver la conjecture de Riemann Hardy Weil Artin , T. Takagi). Siegel Kronecker Hermann Schubert (1848-1911), mathématicien allemand. van der Waerden (1938-40), Bell (1945), Weil Une fonction rationnelle positive sur R n Artin S. N. Bernstein Dirichlet Fuchs Uniformisation des fonctions analytiques complexes au moyen de fonctions fuchsiennes (automorphes). Source et pour en savoir plus :

    26. Plateau
    Translate this page C. Ce problème ardu fut résolu en 1931 par l'américain Jesse Douglas(première médaille Fields, 1936) et tibor rado. Notion
    http://www.sciences-en-ligne.com/momo/chronomath/chrono2/plateau.html
    PLATEAU Joseph Antoine F.
    belge, 1801-1883     calcul des variations minimale de contour C. , 1936) et Tibor Rado Notion de surface minimale : Liens vers des surfaces minimales Cournot

    27. Busy Beaver Turing Machine
    tibor rado, a professor at the Ohio State University, thought of a simple noncomputablefunction besides the standard halting problem for Turing machines.
    http://grail.cba.csuohio.edu/~somos/bb.html
    Busy Beaver Turing Machine
    This story starts around 1960. Tibor Rado, a professor at the Ohio State University, thought of a simple non-computable function besides the standard halting problem for Turing machines. Given a fixed finite number of symbols and states, select those Turing machine programs which eventually halt when run with a blank tape. Among these programs find the maximum number of non-blank symbols left on the tape when they halt. Alternatively, find the maximum number of time steps before halting. This function is well-defined but rapidly becomes un-computable for even a small number of states and symbols. He published an article about it in 1962, but went beyond just writing about a theoretical result. With his student Shen Lin, they actually tackled the two symbol, three state problem. The study resulted in a dissertation for Lin in 1963 and an article in JACM in 1965. After the initial flurry of articles there has been several others mentioning results. The most popular is probably the August 1984 Scientific American Computer Recreations column by Dewdney. There is a PostScript handout by Jeffrey Shallit about the problem.

    28. Turing Machine On A Spreadsheet
    tibor rado, a professor at the Ohio State University, asked in 1962 Find Turingmachine programs that, starting with a blank tape, will produce the most
    http://members.tripod.com/mumnet/tools/tools002.htm
    Mum
    Mathematical Ulterior Motives - the mother of all ulterior sites - tools
    Anyone for a Turing machine on a spreadsheet? To solve a problem means to find a set of actions that brings you from the start state to the goal state. If you can express the states and the actions in a programming language, you can feed the instructions to a computer and let it solve the problem for you. In 1936, before the first electronic computer was built, Alan Turing, described his idea of a simple computer. Even though his machine was of a very uncomplicated design, Turing believed that it could carry out any process which could naturally be called an effective procedure or algorithm. Tape Head happy The machine consisted of a tape divided into cells and a read-write head that could move along the tape. The tape above is empty, nothing is written in the cells. The head starts where the ^ sign is). state read write move new state happy R gloomy happy L content gloomy L happy gloomy R gloomy content L gloomy content R stop A Turing machine can be in several states. The machine above has three states, happy, gloomy and content. It starts in the happy state. The table says that if it reads an empty cell in the happy state it should write a 1, move one cell to the right and go over to the gloomy state (row 2 in the table):

    29. Turing Machines
    This problem was first studied by tibor rado in 1962. States, B(n), sigma(n),Who. java, 2, 4, 6, Shen Lin / tibor rado. java, 3, 6, 13, Shen Lin / tiborrado.
    http://www.cse.unsw.edu.au/~peteg/CompSci/TuringMachines/
    Turing Machines
    Alan Turing's formalisation of computation forms the basis of many surprising results in theoretical computer science. Here I have collected some sample machines, some of the more interesting results, and simple developments of some of them. (Please note there's a bit of cruft here - at least as of August 2000 - which I'd fix if I wasn't so sick of Java.)
    Applet
    The applet used to execute the examples below is available with source code as a jarball I have written a perl program to convert from a more convenient (generic) format to HTML. It handles 5-, 6- and 7- tuple formats, and generates output in several forms - HTML (for running the applet), a bitstring for use as the tape for the universal machine , and a grammar in the form of a Post Symbol Manipulation System.
    Sample Turing Machines
    Here are a few sample Turing machines collected from various places. Their main utility is to illustrate some of the common programming paradigms.

    30. Rado
    Ebben az évben halt meg Fábry Zoltán, Fekete István, Fülep Lajos, Révay József(író, mûfordító), Szabó Pál, Szántó tibor, Szöllõsy Klára
    http://www.c3.hu/scripta/beszelo/98/01/rado.htm

    beszelo@c3.hu
    c3.hu/scripta/
    beszelo@c3.hu
    c3.hu/scripta/

    31. Rado
    awarded to tibor Radó (Click a link below for the full list of mathematicians honouredin this way). AMS Colloquium Lecturer, 1945. ICHB 2002 By GSK, rado.html.
    http://math.ichb.ro/History/Mathematicians/Rado.html

    32. The Linux 1999-February Archive By Author
    linux Problem Miro Bobovsky; linux LDP rado Bonk; linux linux OKI Page4w Jan Kudlicka; linux Elektronika Jan Kudlicka; linux monkey rh5 tibor Kurina;
    http://lists.linux.sk/pipermail/linux/1999-February/author.html
    1999-February Archives by Author
    Starting: Mon Feb 1 06:26:14 1999
    Ending: Sun Feb 28 21:46:35 1999
    Messages:

    33. The Linux 1999-February Archive By Thread
    linux Jadro 2.2.1; unix2dos Peter Paluch. linux LDP tibor Kurina linux LDPVlado Vaclavek; linux LDP Vlado Vaclavek; linux LDP rado Bonk. linux SECURITY
    http://lists.linux.sk/pipermail/linux/1999-February/thread.html
    1999-February Archives by Thread
    Starting: Mon Feb 1 06:26:14 1999
    Ending: Sun Feb 28 21:46:35 1999
    Messages:

    34. EducETH - Informatik - Programmieren Lernen Mit Kara
    Translate this page Von tibor rado (1962) stammt ein Beispiel einer einfachen nicht-berechenbarenFunktion. Für eine gegebene Anzahl n betrachtet man
    http://www.educeth.ch/informatik/karatojava/kara/karafuerprofis.html
    Informatik auf EducETH Home Info Kontakt ... Suchen Programmieren lernen mit Kara KaraToJava Lernprogramme Gruppenarbeiten
    Programmieren     ... FAQ
    Ein Beitrag von Computing Computing , Band 47, pages 235-246, 1992. Kara, die Ameise
    Quellen: Kara, der fleissige Biber
    n betrachtet man Turing-Maschinen mit n S(n) n n (ab 5, 6, ...) ist der Wert von S(n) nicht bekannt. f n . Das heisst, S(n) Quellen:
    • Tibor Rado: On Non-Computable Functions, The Bell System Technical Journal, vol. XLI, no. 3, May 1962, pp. 877-884. Heiner Marxen, Tabelle mit den bisher bekannten Zahlen zu fleissigen Bibern und sein Artikel:
      http://www.drb.insel.de/~heiner/BB/index.html

    35. Search Result For Rona Machlin
    tibor rado, a professor at the Ohio State University, thought of a simple noncomputablefunction besides the standard halting problem Google
    http://hpsearch.uni-trier.de/hp/a-tree/m/Machlin:Rona.html
    Search Result for Rona Machlin
    Personpage in DBLP
    Search Computer Science Bibliography ResearchIndex Cora Google(pdf) ...
  • Data Warehousing and OLAP Bibliography http://www.cs.toronto.edu/~mendel/dwbib.html
    130 Points (Preselect:66) Source: Alta Vista(6); Google(19); Lycos(1); FAST(1); MS Search(20)
    Alta Vista: ... Features of Groups in Relational Databases. Proc. VLDB '96, 295-306. Leonid Libkin, Rona Machlin, Limsoon Wong, A Query Language for Multidimensional Arrays: Design, Implementation, and Optimization ...
    Lycos: Phillip M. Fernandez and Donovan Schneider, The Ins and Outs (and everything in between) of Data Warehousing. ACM SIGMOD 1996 Tutorial Notes. (SIGMOD membership required
    FAST: Papers on data warehousing and online analytical processing available online. more hits from:
    MS Search: Bibliography by Alberto Mendelzon offers links to Web sites and downloadable text documents.
  • Busy Beaver Turing Machine http://cis.csuohio.edu/~somos/bb.html
    129 Points (Preselect:56) Source: Alta Vista(7); Google(9); Lycos(4); Northern Light(13); FAST(4); Direct Hit(3); MS Search(6)
    Alta Vista: Busy Beaver Turing Machine. This story starts around 1960. Tibor Rado, a professor at the Ohio State University, thought of a simple non-computable function besides the standard halting problem...

    • 36. Laura Fermi: Illustrious Immigrants - Hungarian
    111. Paul Erdös and Cornelius Lanczos hold degrees from the University of Budapest;George Polya, tibor rado, Otto Szasz, and Gabor Szegö; studied at the
    http://www.bibl.u-szeged.hu/ha/emigracio/fermi3.html
    HUNGARIANS
    In my search for clues to the mystery of Hungarian talent I talked to so many Hungarians and heard mention of so many more that I gained the impression of a large representation in the cultural wave. But I must have confused quality with quantity. Though they constitute the fourth largest national group the Hungarians in my file are fewer than a hundred, about 5 per cent of the total wave. They themselves explain that they seem more numerous because they have the gift of ubiquity - and some do seem to be in more than one place at the same time - which multiplies the effect of their presence. Indeed, they travel so frequently, so fast, and so unexpectedly that there is certain ground for this belief. But there may be a better explanation. Hungarian intellectuals began to emigrate earlier than those from Not all the early Hungarian emigrants came directly to this country. Among those who did not, there were many students who sought to finish their education outside Hungary: while the Hungarian gymnasiums were excellent the universities were poor and the numerus clausus excluded from them all but 5 per cent of the Jewish students. German universities were the most favored by Hungarians, though some students went to Austria, Czechoslovakia, and elsewhere. The fact that many went to Germany was ground for a casual remark made recently by one of my Hungarian friends: "Why make so much fuss about the Hungarians? They were all educated in Germany anyhow." But this is too broad a generalization.

    37. New Page 1
    16. Roman Milan, 135 SNEHULÁKÚ, 19, 18, 37. 17. Sofka tibor, THC ADIDAS, 24,12, 36. 18. Richter rado, TROCHY, 20, 15, 35. 19. Heštera Patrik, HC VALAŠI,18, 16, 34. 20.
    http://www.hk36.sk/hokejbal/stat_celkom.asp
    Info Výsledky Mužstva Štatistika ... Pravidla Individuálna štatistika hráèov SMHbL
    ZORADI G A K.B. Por. Meno Team G A K.B. Gaïourek Aleš HC AMATERS - O.C.E.Á.N. Kovalovský Nikola HC AMATERS - O.C.E.Á.N. Fábik Igor ŽELEZÁRI Kalka Martin HC 95 BULLDOGS Prochádzka Peter 135 SNEHULÁKÚ Bolebruch Pavol T.H.C. A.D.I.D.A.S. Janáè Marcel HC 95 BULLDOGS Baránek Miroslav T.H.C. A.D.I.D.A.S. Kukliš Patrik HC 95 BULLDOGS Kromerinský Erik HC 95 BULLDOGS Hránek Peter HC AMATERS - O.C.E.Á.N. Petroviè Radek HC VALAŠI Polák Miroslav HC AMATERS - O.C.E.Á.N. Helbich Július HC PANIKA - SMINT Macháèek V HC VALAŠI Macháèek Urban 135 SNEHULÁKÚ Heštera Patrik HC VALAŠI Tyrschel SHOT Sofka Tibor T.H.C. A.D.I.D.A.S. Jarolín René HC 95 BULLDOGS Malec Jaroslav HC VALAŠI Prošvic Jara ŽELEZÁRI Macháèek Martin 135 SNEHULÁKÚ Spáèil Peter 135 SNEHULÁKÚ Mixa Rado HC 95 BULLDOGS Sedláèek Miro HC 95 BULLDOGS Grill Marek ŽELEZÁRI Richter Rado TROCHY Výleta Milan HC VALAŠI Bartal Peter SHOT Roman Milan 135 SNEHULÁKÚ Spáèil Juraj T.H.C. A.D.I.D.A.S. Macejka Roman HC PANIKA - SMINT Krídl SHOT Fabián Jozef ŽELEZÁRI Karvaš Ladislav 135 SNEHULÁKÚ Krajsa Luboš TROCHY Trnovec Róbert T.H.C. A.D.I.D.A.S.

    38. Red Bull Music Academy :: THE ACADEMY :: CONTACTS
    (east), , Peter Juhasz peter@redbullmusicacademy.com. , rado Okrucky rado@redbullmusicacademy.com.(west), , tibor Holoda tibor@redbullmusicacademy.com.
    http://www.redbullmusicacademy.com/statics/contacts_europe.html
    SEARCH HOME THE ACADEMY DJING HISTORY ... ACADEMY FORUM CONTACTS
    Main
    Africa
    Asia/Pacific
    Europe
    Middle East
    North America
    South America
    Europe: Austria Felix Fuchs
    felix@redbullmusicacademy.com     Andreas Pils
    andi@redbullmusicacademy.com     Belgium Manu Ruts manu@redbullmusicacademy.com Alex Klimow alex@redbullmusicacademy.com Filip van Moerkercke filip@redbullmusicacademy.com Koen van Wevewrberg koen@redbullmusicacademy.com Bulgaria, Albania and Macedonia Radomir Vuckovic radomir@redbullmusicacademy.com Bulgaria Stefan Kratchanov stefan@redbullmusicacademy.com Czech Republic Jan Babka jan@redbullmusicacdemy.com Finland Marko Laine marko@redbullmusicacademy.com Oded Peled oded@redbullmusicacademy.com Germany Tim Koblenz tim@redbullmusicacademy.com Monika Neumann monika@redbullmusicacademy.com Stephan Eifridt stephan@redbullmusicacademy.com

    39. RALLY Prešov 2002 - Zoznam Prihlásených Posádok
    Polo VW, 5, 25, Jefta SOS Motorsport (SK), rado CIKOR, SK, Nissan, N, Luboš ŠLÁVKA,SK, Sunny, 3, Martin SYN, SK, 206XS, 7, 28, tibor Kovacs(SK), tibor KOVACS, SK, Škoda,A,
    http://www.rallyracing.sk/pages/rally_PO2002_entryList.php
    RALLY Prešov 2002
    ENTRY LIST
    Zoznam prihlásených posádok
    No
    Entrant
    Driver/Co-Driver
    jazdec/spolujazdec Nat.
    št. prísl. Vehicle
    vozidlo Group/Class
    skup/trieda priority
    priorita     MIMEX MOTOSPORT (SK) Tibor CSERHALMI SK Škoda A FIA B Karol BODNÁR SK Octávia WRC AMK Mikona (SK) Václav PECH jun. CZ Ford A FIA B Petr UHEL CZ Focus WRC SZELECZKI Tamasz (H) Tamasz SZELECZKI H Ford A Escort WRC H.CHVOJKOVÁ (CZ) CHVOJKA CZ Ford A Hana CHVOJKOVÁ CZ Escort Cosworth Jozef Bereš(SK) Jozef BEREŠ SK MAZDA A Marek PODOBNIK SK 323 GTR L.OTTO (CZ) Ludvík OTTO CZ Toyota Celica GT4 A CZ Marcel SITNÍK CZ MITSUBISHI N Petr POULÍK CZ Lancer EVO VI Róbert HORÁK (SK) Robert HORÁK SK MITSUBISHI N Erika HORÁKOVÁ Lancer EVO III IMG MOTORSPORT Tuning (SK) SK FORD N SK Escort Cosworth Pospa Rallye Team (CZ) Petr POSP͊IL CZ Honda A Karel VAJÍK CZ Integra Radim ŠPUREK CZ SUBARU N Impreza Michael HONDA CZ CITROEN A Saxo KIT CAR HM Rally team (SK) Peter HALUŠKA SK ŠKODA A Fabia GM-Rally Sport (SK) István RADO SK Honda N Sándor NAGY SK Civic AMK Vsetín Rallye Team(CZ) Jaromír TOMAŠTÍK CZ Ford N CZ Escort 2000 Veszprémi Rally Team Miskolc(H) Sándor BOGÁR H Peugeot N Rita BACSO H Mr.CAR (CZ)

    40. Mail Index
    From rado Zoltan rado@zeus.banki.hu . Re aqual 200 lityis fémvázas aki Zsolt majorzs@engineer.com . aqua-l teknosbeka From Bicsak tibor el_gh@nextra
    http://listserv.externet.hu/lists/aquarium/0001/
    Mail Index

    A  B  C  D  E  F  G  H  I  J  K  L  M  N  O  P  Q  R  S  T  U  V  W  X  Y  Z  

    Page 2     21-40 of 92    Back | 1  | 2  | 3  | 4  | 5  | Next 20

    free hit counter